Abstract
AbstractThe first goal of this chapter is to introduce the necessary mathematical language to work with triangulations. This language includes the geometry of polyhedra and cones [339] and the combinatorics of point and vector configurations, as described by their oriented matroids [55]. These two books are recommended for more details. The second goal is to provide the reader with formal definitions and notation that are strong but flexible enough to cover all kinds of point configurations, and even the more general case of vector configurations. These definitions should include degeneracies, such as collinearities and repetition of points. We will do this slowly, intending to help the reader to see why a naive definition may lead to problems.KeywordsConvex HullSimplicial ComplexVoronoi DiagramDelaunay TriangulationHeight FunctionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
