Delaunay partitions in R^n applied to non-convex programs and vertex/facet enumeration problems
From MaRDI portal
Publication:706993
DOI10.1016/J.COR.2003.08.018zbMATH Open1071.90034OpenAlexW2032498641MaRDI QIDQ706993FDOQ706993
Lusine Yepremyan, James E. Falk
Publication date: 9 February 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2003.08.018
Recommendations
- Enumerating Delaunay partitions and global optimization
- Non-simplicial Delaunay meshing via approximation by radical partitions
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- On \(d\)-convex partitions of polygonal regions
- Generalized Delaunay triangulations of non-convex domains
- Delaunay partitions
- Minimum convex partitions of multidimensional polyhedrons
- DV-partition and \(L\)-partition in the sense of G. F. Voronoĭ, B. N. Delone, and B. A. Venkov
- On Delaunay oriented matroids for convex distance functions
Voronoi diagramsGlobal optimizationDelaunay partitionsDelaunay simplicesFacet enumerationVertex enumeration
Cites Work
- The relative neighbourhood graph of a finite planar set
- Primal-dual methods for vertex and facet enumeration
- Title not available (Why is that?)
- Title not available (Why is that?)
- Segments in enumerating faces
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- On the complexity of d-dimensional Voronoi diagrams
- A method of Euclidean centers
Cited In (3)
This page was built for publication: Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706993)
