Cargando…
Computing convex quadrangulations()
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.
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
North Holland
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3277885/ https://www.ncbi.nlm.nih.gov/pubmed/22389540 http://dx.doi.org/10.1016/j.dam.2011.11.002 |
_version_ | 1782223521980612608 |
---|---|
author | Schiffer, T. Aurenhammer, F. Demuth, M. |
author_facet | Schiffer, T. Aurenhammer, F. Demuth, M. |
author_sort | Schiffer, T. |
collection | PubMed |
description | 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. |
format | Online Article Text |
id | pubmed-3277885 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2012 |
publisher | North Holland |
record_format | MEDLINE/PubMed |
spelling | pubmed-32778852012-03-01 Computing convex quadrangulations() Schiffer, T. Aurenhammer, F. Demuth, M. Discrete Appl Math Article 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. North Holland 2012-03 /pmc/articles/PMC3277885/ /pubmed/22389540 http://dx.doi.org/10.1016/j.dam.2011.11.002 Text en © 2012 Elsevier B.V. https://creativecommons.org/licenses/by-nc-nd/3.0/ Open Access under CC BY-NC-ND 3.0 (https://creativecommons.org/licenses/by-nc-nd/3.0/) license |
spellingShingle | Article Schiffer, T. Aurenhammer, F. Demuth, M. Computing convex quadrangulations() |
title | Computing convex quadrangulations() |
title_full | Computing convex quadrangulations() |
title_fullStr | Computing convex quadrangulations() |
title_full_unstemmed | Computing convex quadrangulations() |
title_short | Computing convex quadrangulations() |
title_sort | computing convex quadrangulations() |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3277885/ https://www.ncbi.nlm.nih.gov/pubmed/22389540 http://dx.doi.org/10.1016/j.dam.2011.11.002 |
work_keys_str_mv | AT schiffert computingconvexquadrangulations AT aurenhammerf computingconvexquadrangulations AT demuthm computingconvexquadrangulations |