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, ...
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penni...
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...