Nonobtuse triangulation of polygons
Discrete & Computational Geometry
Globally-Equiangular triangulations of co-circular points in 0(n log n) time
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
On optimal interpolation triangle incidences
SIAM Journal on Scientific and Statistical Computing
Triangulating a nonconvex polytope
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
An O(n2log n) time algorithm for the MinMax angle triangulation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Separators in two and three dimensions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Polynomial-size nonobtuse triangulation of polygons
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Approximating the minimum weight triangulation
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On triangulations of a set of points in the plane
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A Modified Quadtree Approach To Finite Element Mesh Generation
IEEE Computer Graphics and Applications
Approximating the minimum weight triangulation
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Guaranteed-quality Delaunay meshing in 3D (short version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Dihedral bounds for mesh generation in high dimensions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximate minimum weight Steiner triangulation in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Navigating through triangle meshes implemented as linear quadtrees
ACM Transactions on Graphics (TOG)
Journal of the ACM (JACM)
Static and kinetic geometric spanners with applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Nice point sets can have nasty Delaunay triangulations
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Quality meshing with weighted Delaunay refinement
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
Computational Geometry: Theory 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
Quadtree Decomposition, Steiner Triangulation, and Ray Shooting
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Approximating Uniform Triangular Meshes in Polygons
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Layer based solutions for constrained space-time meshing
Applied Numerical Mathematics - Special issue: Applied numerical computing: Grid generation and solution methods for advanced simulations
A time efficient Delaunay refinement algorithm
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Tiling space and slabs with acute tetrahedra
Computational Geometry: Theory and Applications
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles
Combinatorics, Probability and Computing
Quality meshing for polyhedra with small angles
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Isotopic implicit surface meshing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Time complexity of practical parallel steiner point insertion algorithms
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Surface reconstruction from scan paths
Future Generation Computer Systems - Special issue: Computer graphics and geometric modeling
A time-optimal delaunay refinement algorithm in two dimensions
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Sliver removal by lattice refinement
Proceedings of the twenty-second annual symposium on Computational geometry
Sparse parallel Delaunay mesh refinement
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Isosurface stuffing: fast tetrahedral meshes with good dihedral angles
ACM SIGGRAPH 2007 papers
Triangulations with locally optimal Steiner points
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Triangulating a convex polygon with fewer number of non-standard bars
Theoretical Computer Science
Computational Geometry: Theory and Applications
Size complexity of volume meshes vs. surface meshes
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Quadrilateral meshes with bounded minimum angle
Proceedings of the twenty-fifth annual symposium on Computational geometry
Delaunay Triangulation of Imprecise Points Simplified and Extended
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Eliminating contour line artefacts by using constrained edges
Computers & Geosciences
Surface reconstruction from scan paths
Future Generation Computer Systems
Dynamic well-spaced point sets
Proceedings of the twenty-sixth annual symposium on Computational geometry
SIAM Journal on Scientific Computing
Parallelism in dynamic well-spaced point sets
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Beating the spread: time-optimal point meshing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Proceedings of the twenty-seventh annual symposium on Computational geometry
Triangulating a convex polygon with small number of non-standard bars
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Maximizing maximal angles for plane straight-line graphs
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
New Bounds on the Size of Optimal Meshes
Computer Graphics Forum
Structure from motion based approaches to 3d reconstruction in minimal invasive laparoscopy
ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part II
Size competitive meshing without large angles
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Maximizing maximal angles for plane straight-line graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Quality isosurface mesh generation using an extended marching cubes lookup table
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
Dynamic well-spaced point sets
Computational Geometry: Theory and Applications
Manifold surface reconstruction of an environment from sparse Structure-from-Motion data
Computer Vision and Image Understanding
Distance-Sensitive planar point location
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Dynamic planar point location with sub-logarithmic local updates
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We study several versions of the problem of generating triangular meshes for finite element methods. We show how to triangulate a planar point set or polygonally bounded domain with triangles of bounded aspect ratio; how to triangulate a planar point set with triangles having no obtuse angles; how to triangulate a point set in arbitrary dimension with simplices of bounded aspect ratio; and how to produce a linear-size Delaunay triangulation of a multidimensional point set by adding a linear number of extra points. All our triangulations have size (number of triangles) within a constant factor of optimal and run in optimal time O(n log n + k) with input of size n and output of size k. No previous work on mesh generation simultaneously guarantees well-shaped elements and small total size.