Triangulations : Structures for Applications and Algorithms
By J. D. Loera, Jörg Rambau, Francisco Santos. 2010
499 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design
View Paper: https://www.semanticscholar.org/paper/08c358a338e538eaf1e5aac315b045896e09f0b4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Michael Joswig
- Federico Ardila
- Alexander Postnikov
- Christopher Eur
- Bernd Sturmfels
- Sarah B. Brodsky
- Ralph Morrison
- Stavros Garoufalidis
In Computer Graphics and Computer-Aided Design
- Bernd Sturmfels
- Craig Hodgson
- Henry Segerman
- Stavros Garoufalidis
- Sarah B. Brodsky
- Ralph Morrison
- J. Hyam Rubinstein
- Alexander Postnikov
Citations in the corpus
- 1-efficient triangulations and the index of a cusped hyperbolic 3-manifold (2013, methodology): “The main tool we will use is the theory of regular triangulations of point configurations, following [9].”
- Moduli of tropical plane curves (2014, background): “torics. In this section we x notation, supply denitions, present algorithms, and give some core results. For additional background, the reader is referred to the book by De Loera, Rambau, and Santos [13]. Let P be a lattice polygon, and let A= P\Z2 be the set of lattice points in P. Any function h: ”
- The positive Dressian equals the positive tropical Grassmannian (2020, unknown): “(See [DLRS10] for background on regular subdivisions.”
- Coxeter submodular functions and deformations of Coxeter permutahedra (2019, background): “For a more detailed treatment and proofs, see for example [12] or [14].”
- The diameter of associahedra (2012, background): “guments. Invoking Theorem 2, Lemma 1 can be rephrased as the first part of Theorem 1: the diameter of the d-dimensional associahedron is not greater than 2d 4 when d is greater than 9. As discussed in [6, 7, 9], finding lower bounds on flip distances is the dicult part, tough. Lemma 3 from [6], whose p”