From a566bc834666f130bec2d7dd21fbe8bc18ec27e7 Mon Sep 17 00:00:00 2001 From: "Jostein R. Natvig" Date: Thu, 14 Oct 2010 05:37:00 +0000 Subject: [PATCH] Comment. MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Bård Skaflestad --- facetopology.c | 13 ++++++++----- 1 file changed, 8 insertions(+), 5 deletions(-) diff --git a/facetopology.c b/facetopology.c index 897eba61..66eb08b6 100644 --- a/facetopology.c +++ b/facetopology.c @@ -59,7 +59,7 @@ along with OpenRS. If not, see . /*------------------------------------------------------*/ -/* Determine face geometry first, then compute intersections. */ +/* Determine face topology first, then compute intersection. */ /* All intersections that occur are present in the final face geometry.*/ static int *computeFaceTopology(int *a1, int *a2, @@ -169,11 +169,14 @@ static int *computeFaceTopology(int *a1, -/* a) If we assume that the index increase when z increase for - each pillar (but only separately), we can use only the point indices. +/* a) If we assume that the index increase when z increase for each + pillar (but only separately), we can use only the point indices, + since we only need to compare z-values on one pillar at a time. - b) We assume no intersections occur on the first and last lines. - This is convenient in the identification of (unique) intersections. + b) We assume input is preprocessed such that no intersections occur + on the first and last lines, for instance by padding the grid + with extra cells. This is convenient in the identification of + (unique) intersections. */