Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems

Computers and Operations Research

Volumn 32, Issue 4, 2005, Pages 793-812

  Yepremyan, Lusine ^a   Falk, James E ^b  

^a The George Washington University   (United States)

^b BOGAZICI UNIVERSITY   (Turkey)

Author keywords

Delaunay partitions; Delaunay simplices; Facet enumeration; Global optimization; Vertex enumeration; Voronoi diagrams

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GLOBAL OPTIMIZATION; LINEAR PROGRAMMING; PROBLEM SOLVING;

DELAUNAY PARTITIONS; DELAUNAY SIMPLICES; FACET ENUMERATION; VERTEX ENUMERATION; VORONOI DIAGRAMS;

OPERATIONS RESEARCH;

EID: 5644279133     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.08.018     Document Type: Article

References (16)

1. Guibas L., Stolfi J. Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. ACM Transactions on Graphics. 4(2):1985;74-123.
2. Klee V. On the complexity of. d -dimensional Voronoi diagrams Archiv der Mathematic. 34:1980;75-80.
3. Preparata F.P., Shamos M.I. Computational geometry - an introduction. 1978;Springer, New York.
4. Shamos MI, Hoey D. Closest-point problems. Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA; 1976. p. 208-15.
5. Edelsbrunner H. Algorithms in combinatorial geometry. 1987;Springer, Berlin.
6. Aurenhammer F. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Computing Surveys. 23(3):1991;345-405.
7. Lattuada R, Raper J. Applications of 3D Delaunay triangulation algorithms in geoscientific modelling, available at http://www.ncgia.ucsb.edu/conf/ SANTA_FE_CD-ROM/sf_papers/lattuada_roberto/paper.html, 1995.
8. Toussaint G.T. The relative neighborhood graph of a finite planar set. Pattern Recognition. 12:1980;261-268.
9. Shewchuk JR. Tetrahedral mesh generation by Delaunay refinement. Proceedings of the 14th Annual Symposium on Computational Geometry, Minneapolis, Minnesota, United States; 1998. p. 86-95.
10. Okabe B., Boots B., Sugihara K. Spatial tesselations: concepts and applications of Voronoi diagrams. 1992;Wiley, New York.
11. d . Proceedings of the 7th Annual Symposium on Computational Geometry, North Conway, New Hampshire, United States; June 10-12, 1991. p. 357-63.
12. Bremner D, Fukuda K, Marzetta A. Primal-dual methods for vertex and facet enumeration (preliminary version). Proceedings of the 13th Annual Symposium on Computational Geometry, Nice, France; 1997. p. 49-56.
13. Murty KG. A problem in enumerating extreme points, draft 2002, available at http://www.personal.engin.umich.edu/~murty/segments-10.pdf .
14. Murty K.G., Chung S.J. Segments in enumerating facets. Mathematical Programming. 70:1995;27-45.
15. Falk JE, Benchekroun B. A nonconvex piecewise linear optimization problem. [special issue.] Computers & Mathematics with Applications 1990; 1-9.
16. Fagan J.T., Falk J.E. A method of Euclidean centers. Computers & Operations Research. 23(1):1996;13-25.