IEEE Transactions on Visualization and Computer Graphics · 2002 · 112 citations · 36 references
ArchitectureVisualization3D ModelingComputational GeometryGeometric ModelingGeometry ProcessingMesh GenerationMesh ProcessingSolid ModelingSurface ModelingSurface ReconstructionComplex SurfacesImplicit SurfacesPolygonal MeshingPolygonal RepresentationPolygonal Surface RepresentationRobust Mesh GenerationSolid Geometry ModelingVolumetric Representation
Implicit surfaces are used in computer graphics for modeling soft or organic objects, morphing, collision detection, and constructive solid geometry, yet creating them remains challenging. The authors present a practical method for generating high‑quality implicit surfaces from polygonal models, targeting complex geometries. The method employs a 3‑D variational interpolation (thin‑plate generalization) that converts a polygonal mesh into a volumetric guide, seeds the surface with constraint points, and iteratively refines it by adding constraints based on error evaluation. The technique has been successfully applied to diverse polygonal meshes, demonstrating robustness.
Implicit surfaces are used for a number of tasks in computer graphics, including modeling soft or organic objects, morphing, collision detection, and constructive solid geometry. Although operating on implicit surfaces is usually straightforward, creating them is not. We introduce a practical method for creating implicit surfaces from polygonal models that produces high-quality results for complex surfaces. Whereas much previous work in implicit surfaces has been done with primitives such as "blobbies," we use implicit surfaces based on a variational interpolation technique (the three-dimensional generalization of thin-plate interpolation). Given a polygonal mesh, we convert the data to a volumetric representation to use as a guide for creating the implicit surface iteratively. We begin by seeding the surface with a number of constraint points through which the surface must pass. Iteratively, additional constraints are added; the resulting surfaces are evaluated, and the errors guide the placement of subsequent constraints. We have applied our method successfully to a variety of polygonal meshes and consider it to be robust.
36
Per‐Erik Danielsson · Computer Graphics and Image Processing · 1980 · 2K citations
A Generalization of Algebraic Surface Drawing
J.F. Blinn · ACM Transactions on Graphics · 1982 · 1K citations
Data structure forsoft objects
Geoff Wyvill, Craig McPheeters, Brian Wyvill · The Visual Computer · 1986 · 765 citations
Adaptively sampled distance fields
Sarah Frisken, Ronald N. Perry, Alyn Rockwood et al. · 2000 · 576 citations · Full text