99 search results - page 12 / 20 » On empty convex polygons in a planar point set |
IWCIA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
107
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
106
click to vote
CGF
2008
14 years 11 months ago
2008
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
WADS
1997
Springer
15 years 3 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
ACCV
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we propose a convex optimization based approach for piecewise planar reconstruction. We show that the task of reconstructing a piecewise planar environment can be se...