176 search results - page 3 / 36 » Unbalanced Points and Vertices Problem |
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
— We present a new sampling-based algorithm for iteratively locating Voronoi vertices of a point set in the unit cube Id = [0, 1]d . The algorithm takes an input sample and execu...
CCCG
2007
13 years 7 months ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
IBPRIA
2003
Springer
13 years 11 months ago
2003
Springer
We describe a technique for extracting vertices from range images of cluttered box-like objects. Edge detection is performed and an edge map is acquired. Extraction of vertices is ...
CCCG
2009
13 years 6 months ago
2009
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
GC
2011
Springer
12 years 9 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...