99 search results - page 16 / 20 » On empty convex polygons in a planar point set |
138
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
101
click to vote
CCCG
2003
15 years 29 days ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
93
Voted
ALGOSENSORS
2008
Springer
15 years 1 months ago
2008
Springer
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
IJRR
2002
14 years 11 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
RT
2001
Springer
15 years 4 months ago
2001
Springer
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...