Small strictly convex quadrilateral meshes of point sets

From MaRDI portal
Publication:1889600

DOI10.1007/S00453-003-1062-1zbMATH Open1072.68120arXivcs/0202011OpenAlexW2054150222MaRDI QIDQ1889600FDOQ1889600


Authors: David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán Edit this on Wikidata


Publication date: 2 December 2004

Published in: Algorithmica (Search for Journal in Brave)

Abstract: In this paper, we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we show that 3lfloorfracn2floor internal Steiner points are always sufficient for a convex quadrilateral mesh of n points in the plane. Furthermore, for any given ngeq4, there are point sets for which lceilfracn32ceil1 Steiner points are necessary for a convex quadrilateral mesh.


Full work available at URL: https://arxiv.org/abs/cs/0202011




Recommendations





Cited In (11)





This page was built for publication: Small strictly convex quadrilateral meshes of point sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889600)