99 search results - page 15 / 20 » On empty convex polygons in a planar point set |
130
click to vote
ECCV
2010
Springer
14 years 9 months ago
2010
Springer
Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is ...
ICRA
2003
IEEE
15 years 4 months ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
COMPGEOM
1996
ACM
15 years 3 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
114
click to vote
COMPGEOM
2001
ACM
15 years 3 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
102
click to vote
SSD
2001
Springer
15 years 4 months ago
2001
Springer
Recently there is much interest in moving objects databases, and data models and query languages have been proposed offering data types such as moving point and moving region toge...