2002 · 591 citations · 19 references
ComputingComputer ScienceAlgorithmsComputational GeometryGeometric ModelingContour GenerationGeometric ApproximationGeometry ProcessingNumerical AlgorithmsNumerical AnalysisContour SimplificationContouringDual ContouringExact Intersection ComputationHermite FunctionsOctree DecompositionOctreesPatching
This paper describes a new method for contouring a signed grid whose edges are tagged by Hermite data (i.e; exact intersection points and normals). This method avoids the need to explicitly identify and process "features" as required in previous Hermite contouring methods. Using a new, numerically stable representation for quadratic error functions, we develop an octree-based method for simplifying contours produced by this method. We next extend our contouring method to these simpli£ed octrees. This new method imposes no constraints on the octree (such as being a restricted octree) and requires no "crack patching". We conclude with a simple test for preserving the topology of the contour during simplification.
19
Computer graphics: principles and practice
Choice Reviews Online · 2013 · 4.7K citations
Adaptively sampled distance fields
Sarah Frisken, Ronald N. Perry, Alyn Rockwood et al. · 2000 · 576 citations · Full text