Computational geometry: an introduction
Computational geometry: an introduction
Voronoi diagrams with barriers and the shortest diagonal problem
Information Processing Letters
Generating random points in triangles
Graphics gems
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Multiresolution analysis of arbitrary meshes
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Delaunay mesh generation governed by metric specifications. Part I algorithms
Finite Elements in Analysis and Design
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Algorithmic geometry
Simplifying surfaces with color and texture using quadric error metrics
Proceedings of the conference on Visualization '98
Fast and memory efficient polygonal simplification
Proceedings of the conference on Visualization '98
Multiresolution signal processing for meshes
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Using generic programming for designing a data structure for polyhedral surfaces
Computational Geometry: Theory and Applications - Special issue on applications and challenges
New quadric metric for simplifiying meshes with appearance attributes
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
Generating random points in a tetrahedron
Journal of Graphics Tools
Computing a canonical polygonal schema of an orientable triangulated surface
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A simple and efficient error-diffusion algorithm
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Optimally cutting a surface into a disk
Proceedings of the eighteenth annual symposium on Computational geometry
Interactive geometry remeshing
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Signal-specialized parametrization
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
Multiresolution feature extraction for unstructured meshes
Proceedings of the conference on Visualization '01
Optimal System of Loops on an Orientable Surface
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
GRIN'01 No description on Graphics interface 2001
SMA '97 Proceedings of the 1997 International Conference on Shape Modeling and Applications (SMA '97)
Computational Geometry: Theory and Applications
Constrained CVT meshes and a comparison of triangular mesh generators
Computational Geometry: Theory and Applications
On centroidal voronoi tessellation—energy smoothness and fast computation
ACM Transactions on Graphics (TOG)
Packing circles and spheres on surfaces
ACM SIGGRAPH Asia 2009 papers
Isotropic remeshing with fast and exact computation of Restricted Voronoi Diagram
SGP '09 Proceedings of the Symposium on Geometry Processing
Hyperbolic centroidal Voronoi tessellation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
SMI 2011: Full Paper: Capacity-Constrained Delaunay Triangulation for point distributions
Computers and Graphics
Centroidal Voronoi tessellation in universal covering space of manifold surfaces
Computer Aided Geometric Design
Vertex location optimisation for improved remeshing
Graphical Models
| Hi-index | 0.00 |
This paper proposes a new method for isotropic remeshing of triangulated surface meshes. Given a triangulated surface mesh to be resampled and a user-specified density function defined over it, we first distribute the desired number of samples by generalizing error diffusion, commonly used in image halftoning, to work directly on mesh triangles and feature edges. We then use the resulting sampling as an initial configuration for building a weighted centroidal Voronoi diagram in a conformal parameter space, where the specified density function is used for weighting. We finally create the mesh by lifting the corresponding constrained Delaunay triangulation from parameter space. A precise control over the sampling is obtained through a flexible design of the density function, the latter being possibly low-pass filtered to obtain a smoother gradation. We demonstrate the versatility of our approach through various remeshing examples.