Sciweavers

3 search results - page 1 / 1
» Decompositions, Partitions, and Coverings with Convex Polygo...
Sort
View
GC
2007
Springer
14 years 9 months ago
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
Oswin Aichholzer, Clemens Huemer, S. Kappes, Betti...
CORR
2002
Springer
93views Education» more  CORR 2002»
14 years 9 months ago
On the Reflexivity of Point Sets
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...
Esther M. Arkin, Sándor P. Fekete, Ferran H...
WSCG
2004
156views more  WSCG 2004»
14 years 11 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...