IEEE Transactions on Visualization and Computer Graphics · 2004 · 206 citations · 39 references
ComputingComputer ScienceMathematicsComputational GeometryData StructuresTopologyComputational TopologyCritical Point AnalysisGeometric ApproximationGeometry ProcessingSurface ReconstructionTopological ModelingCritical PointsError BoundsHierarchyMorse-smale ComplexesMultiresolution Data RepresentationMultiresolution RepresentationTopological HierarchyTriangulation Data Structures
We combine topological and geometric methods to construct a multiresolution representation for a function over a two-dimensional domain. In a preprocessing stage, we create the Morse-Smale complex of the function and progressively simplify its topology by cancelling pairs of critical points. Based on a simple notion of dependency among these cancellations, we construct a hierarchical data structure supporting traversal and reconstruction operations similarly to traditional geometry-based representations. We use this data structure to extract topologically valid approximations that satisfy error bounds provided at runtime.
39
Surface simplification using quadric error metrics
Michael Garland, Paul S. Heckbert · 1997 · 3.4K citations
Hugues Hoppe · 1996 · 2.8K citations · Full text
Monotone Piecewise Cubic Interpolation
F.N. Fritsch, R.E. Carlson · SIAM Journal on Numerical Analysis · 1980 · 2.4K citations
A signal processing approach to fair surface design
Gabriel Taubin · 1995 · 1.8K citations
Topological Persistence and Simplification
Edelsbrunner, Letscher, Zomorodian · Discrete & Computational Geometry · 2002 · 1.8K citations · Full text