Delaunay partitions in R^n applied to non-convex programs and vertex/facet enumeration problems

DOI10.1016/J.COR.2003.08.018MaRDI QIDQ706993zbMATHOpenAlexFDO

Authors 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

zbMATH Keywords

Voronoi diagramsGlobal optimizationDelaunay partitionsDelaunay simplicesFacet enumerationVertex enumeration

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

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

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 1079755 (Why is no real title available?)
• A method of Euclidean centers
• On the complexity of d-dimensional Voronoi diagrams
• Primal-dual methods for vertex and facet enumeration
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Segments in enumerating faces
• The relative neighbourhood graph of a finite planar set

Cited in

(4)

• Squaring the circle: an algorithm for generating polyhedral invariant sets from ellipsoidal ones
• Enumerating Delaunay partitions and global optimization
• Non-simplicial Delaunay meshing via approximation by radical partitions
• An algorithm for approximate multiparametric convex programming

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)