Sciweavers

CORR
2002
Springer
86views Education» more  CORR 2002»
14 years 8 months ago
Small Strictly Convex Quadrilateral Meshes of Point Sets
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 sh...
David Bremner, Ferran Hurtado, Suneeta Ramaswami, ...
96
Voted
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
14 years 10 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth