Computing convex quadrangulations

T. Schiffer; F. Aurenhammer; M. Demuth

doi:10.1016/j.dam.2011.11.002

Computing convex quadrangulations

T. Schiffer, F. Aurenhammer, M. Demuth

Institute of Machine Learning and Neural Computation (7080)

Publikation: Beitrag in einer Fachzeitschrift › Artikel › Begutachtung

Abstract

We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a given set of points in the plane. The new method improves over the popular pairing method based on triangulating the point set.

Originalsprache	englisch
Seiten (von - bis)	648-656
Fachzeitschrift	Discrete Applied Mathematics
Jahrgang	160
Ausgabenummer	4-5
DOIs	https://doi.org/10.1016/j.dam.2011.11.002
Publikationsstatus	Veröffentlicht - 2012

Fields of Expertise

Information, Communication & Computing

Zugriff auf Dokument

10.1016/j.dam.2011.11.002Lizenz: CC BY-NC-ND 3.0

Dieses zitieren

@article{ad10312f25af4925ba10092bfe888f9a,

title = "Computing convex quadrangulations",

abstract = "We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a given set of points in the plane. The new method improves over the popular pairing method based on triangulating the point set.",

author = "T. Schiffer and F. Aurenhammer and M. Demuth",

year = "2012",

doi = "10.1016/j.dam.2011.11.002",

language = "English",

volume = "160",

pages = "648--656",

journal = "Discrete Applied Mathematics",

issn = "1872-6771",

publisher = "Elsevier B.V.",

number = "4-5",

}

TY - JOUR

T1 - Computing convex quadrangulations

AU - Schiffer, T.

AU - Aurenhammer, F.

AU - Demuth, M.

PY - 2012

Y1 - 2012

N2 - We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a given set of points in the plane. The new method improves over the popular pairing method based on triangulating the point set.

AB - We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a given set of points in the plane. The new method improves over the popular pairing method based on triangulating the point set.

U2 - 10.1016/j.dam.2011.11.002

DO - 10.1016/j.dam.2011.11.002

M3 - Article

SN - 1872-6771

VL - 160

SP - 648

EP - 656

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 4-5

ER -

Computing convex quadrangulations

Abstract

Fields of Expertise

Zugriff auf Dokument

Fingerprint

Dieses zitieren