SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Quality mesh generation in three dimensions
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation
A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation
Triangulating topological spaces
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Free-form shape design using triangulated surfaces
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Large mesh generation from boundary models with parametric face representation
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Guaranteed-quality Delaunay meshing in 3D (short version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Dihedral bounds for mesh generation in high dimensions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Constructing the constrained Delaunay triangulation on the Intel paragon
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Mesh generation for domains with small angles
Proceedings of the sixteenth annual symposium on Computational geometry
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Proceedings of the sixteenth annual symposium on Computational geometry
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
Proceedings of the sixteenth annual symposium on Computational geometry
Quality meshing with weighted Delaunay refinement
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A local coordinate system on a surface
Proceedings of the seventh ACM symposium on Solid modeling and applications
A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces
Proceedings of the seventh ACM symposium on Solid modeling and applications
Approximating uniform triangular meshes in polygons
Theoretical Computer Science
Approximating Uniform Triangular Meshes for Spheres
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Approximating Uniform Triangular Meshes in Polygons
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Triangulation of NURBS surfaces through adaptive refinement
Machine Graphics & Vision International Journal
Curve and Surface Reconstruction in R2 and R3
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Provably good surface sampling and approximation
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Sampling and meshing a surface with guaranteed topology and geometry
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Guaranteed Quality Triangulation of Molecular Skin Surfaces
VIS '04 Proceedings of the conference on Visualization '04
Learning smooth objects by probing
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Centroidal Voronoi diagrams for isotropic surface remeshing
Graphical Models - Special issue on SMI 2003
Two triangulation methods based on edge refinement
Computing - Geometric modelling dagstuhl 2002
Provably good sampling and meshing of surfaces
Graphical Models - Solid modeling theory and applications
Geodesic Remeshing Using Front Propagation
International Journal of Computer Vision
Provably good sampling and meshing of Lipschitz surfaces
Proceedings of the twenty-second annual symposium on Computational geometry
Recent progress in robust and quality Delaunay mesh generation
Journal of Computational and Applied Mathematics - Special issue: The international symposium on computing and information (ISCI2004)
A distributed system based on web services for computational science simulations
Proceedings of the 20th annual international conference on Supercomputing
An effective condition for sampling surfaces with guarantees
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Learning smooth shapes by probing
Computational Geometry: Theory and Applications
Voronoi-Delaunay duality and Delaunay meshes
Proceedings of the 2007 ACM symposium on Solid and physical modeling
A generic software design for Delaunay refinement meshing
Computational Geometry: Theory and Applications
Optimistic parallelism requires abstractions
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Nonobtuse remeshing and mesh decimation
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Reconstruction using witness complexes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Delaunay refinement for piecewise smooth complexes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Triangulating a convex polygon with fewer number of non-standard bars
Theoretical Computer Science
Algorithm 870: A static geometric Medial Axis domain decomposition in 2D Euclidean space
ACM Transactions on Mathematical Software (TOMS)
Three-dimensional delaunay refinement for multi-core processors
Proceedings of the 22nd annual international conference on Supercomputing
Scheduling strategies for optimistic parallel execution of irregular programs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Efficient terrain triangulation and modification algorithms for game applications
International Journal of Computer Games Technology - Joint International Conference on Cyber Games and Interactive Entertainment 2006
On the Scalability of an Automatically Parallelized Irregular Application
Languages and Compilers for Parallel Computing
How much parallelism is there in irregular applications?
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Overlapping Yee FDTD Method on Nonorthogonal Grids
Journal of Scientific Computing
Guaranteed-quality anisotropic mesh generation for domains with curved boundaries
Computer-Aided Design
Quadrilateral meshes with bounded minimum angle
Proceedings of the twenty-fifth annual symposium on Computational geometry
Journal of Parallel and Distributed Computing
Technical Section: Variational implicit surface meshing
Computers and Graphics
Optimistic parallelism requires abstractions
Communications of the ACM - The Status of the P versus NP Problem
Repairing and meshing imperfect shapes with Delaunay refinement
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Parallel programming with object assemblies
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Locally implicit discontinuous Galerkin method for time domain electromagnetics
Journal of Computational Physics
A template for developing next generation parallel Delaunay refinement methods
Finite Elements in Analysis and Design
Computational science simulations based on web services
ICCS'03 Proceedings of the 2003 international conference on Computational science
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Safe nondeterminism in a deterministic-by-default parallel language
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synthesizing concurrent schedulers for irregular algorithms
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Fully Generalized Two-Dimensional Constrained Delaunay Mesh Refinement
SIAM Journal on Scientific Computing
BronWall: a software system for volumetric quantification of the bronchial wall remodeling in MDCT
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
The tao of parallelism in algorithms
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
SMI 2011: Full Paper: Localized Cocone surface reconstruction
Computers and Graphics
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Assessment of airway remodeling in asthma: volumetric versus surface quantification approaches
MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
Triangulating a convex polygon with small number of non-standard bars
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A GPU implementation of inclusion-based points-to analysis
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Geometrical mesh improvement properties of delaunay terminal edge refinement
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Computational Geometry: Theory and Applications
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Natural neighbor coordinates of points on a surface
Computational Geometry: Theory and Applications
Delaunay conforming iso-surface, skeleton extraction and noise removal
Computational Geometry: Theory and Applications
A review on delaunay refinement techniques
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Guaranteed quality tetrahedral Delaunay meshing for medical images
Computational Geometry: Theory and Applications
Hi-index | 0.01 |
For several commonly-used solution techniques for partial differential equations, the first step is to divide the problem region into simply-shaped elements, creating a mesh. We present a technique for creating high-quality triangular meshes for regions on curved surfaces. This technique is an extension of previous methods we developed for regions in the plane. For both flat and curved surfaces, the resulting meshes are guaranteed to exhibit the following properties: (1) internal and external boundaries are respected, (2) element shapes are guaranteed—all elements are triangles with angles between 30 and 120 degrees (with the exception of badly shaped elements that may be required by the specified boundary), and (3) element density can be controlled, producing small elements in “interesting” areas and large elements elsewhere. An additional contribution of this paper is the development of a practical generalization of Delaunay triangulation to curved surfaces.