52 search results - page 8 / 11 » Decomposing a simple polygon into pseudo-triangles and conve... |
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
75
Voted
CCCG
2007
14 years 11 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
DCG
2007
14 years 9 months ago
2007
We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Specifically, for any n-Venn diagram of conve...
ICRA
2003
IEEE
15 years 2 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 ...
CAGD
2007
14 years 9 months ago
2007
Barycentric coordinates are a fundamental concept in computer graphics and geometric modeling. We extend the geometric construction of Floater’s mean value coordinates [8,11] to...