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

DOI10.1016/j.cor.2003.08.018zbMath1071.90034OpenAlexW2032498641MaRDI QIDQ706993

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

Global optimizationVoronoi diagramsDelaunay partitionsDelaunay simplicesFacet enumerationVertex enumeration

Mathematics Subject Classification ID

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

Related Items (2)

An algorithm for approximate multiparametric convex programming ⋮ Squaring the circle: an algorithm for generating polyhedral invariant sets from ellipsoidal ones

Cites Work

• On the complexity of d-dimensional Voronoi diagrams
• The relative neighbourhood graph of a finite planar set
• Primal-dual methods for vertex and facet enumeration
• Segments in enumerating faces
• A method of Euclidean centers
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Unnamed Item
• Unnamed Item

This page was built for publication: Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems