Log in to save to my catalogue

Delaunay and Regular Triangulations as Lexicographic Optimal Chains

Delaunay and Regular Triangulations as Lexicographic Optimal Chains

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_hal_primary_oai_HAL_hal_04119345v1

Delaunay and Regular Triangulations as Lexicographic Optimal Chains

About this item

Full title

Delaunay and Regular Triangulations as Lexicographic Optimal Chains

Publisher

New York: Springer US

Journal title

Discrete & computational geometry, 2023-07, Vol.70 (1), p.1-50

Language

English

Formats

Publication information

Publisher

New York: Springer US

More information

Scope and Contents

Contents

We introduce a total order on
n
-simplices in the
n
-Euclidean space for which the support of the lexicographic-minimal chain with the convex hull boundary as boundary constraint is precisely the
n
-dimensional Delaunay triangulation, or in a more general setting, the regular triangulation of a set of weighted points. This new cha...

Alternative Titles

Full title

Delaunay and Regular Triangulations as Lexicographic Optimal Chains

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_hal_primary_oai_HAL_hal_04119345v1

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_hal_primary_oai_HAL_hal_04119345v1

Other Identifiers

ISSN

0179-5376

E-ISSN

1432-0444

DOI

10.1007/s00454-023-00485-1

How to access this item