Geometry and Topology for Mesh Generation
By Herbert Edelsbrunner. Cambridge monographs on applied and computational mathematics, 2001
650 citations recorded by the source corpus.
Subfields: Computer Graphics and Computer-Aided Design
View Paper: https://www.semanticscholar.org/paper/05c776880af4dab0235270052fb32fe19420f8a3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Graphics and Computer-Aided Design
- Alexander I. Bobenko
- Ivan Izmestiev
- Boris A. Springborn
- Jean-Daniel Boissonnat
- Jingliang Peng
- Max Wardetzky
- Eitan Grinspun
- Chang-Su Kim
Citations in the corpus
- Eurographics Symposium on Geometry Processing (2007) Discrete Laplace Operators: No Free Lunch (background): “Our belief stems from the link between regularity and weighted Delaunay triangulation [Ede01]: given a weighted Delaunay triangulation, when a vertex (arbitrarily far away from a given vertex i) is moved, the restoration of the weighted-Delaunay invariants can require re-tessellation or…”
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator (2015, background): “Methods with certain theoretical guarantees on a successful termination and good mesh quality were developed, see Bern and Eppstein [1995] and Edelsbrunner [2001].”
- ALEXANDROV'S THEOREM, WEIGHTED DELAUNAY TRIANGULATIONS, AND MIXED VOLUMES (2006, background): “Originally weighted Delaunay triangulations are defined for V ⊂ R(2), and M the convex hull of V , see [4], [10], [14].”
- Technologies for 3D mesh compression: A survey (2005, background): “More rigorous definitions can be found in [10] [11] [12].”
- A variational principle for weighted Delaunay triangulations and hyperideal polyhedra (2006, background): “) Weighted Delaunay triangulations are a well known generalization of Delaunay triangulations [15], where the sites are not points but circles (vertex-circles).”
- An explicit link between Gaussian fields and Gaussian Markov random fields: the stochastic partial differential equation approach (2011, background): “See for example Edelsbrunner (2001); Hjelle and Dæhlen (2006) for algorithm details.”
- Provably good sampling and meshing of surfaces (2005, background): “Proof We proceed as in the case of planar meshes [23, 30] and bound the integral over S of 1/φ2(t).”