28 search results - page 1 / 6 » On sequential triangulations of simple polygons |
50
Voted
CCCG
2004
14 years 11 months ago
2004
CAIP
2007
Springer
15 years 3 months ago
2007
Springer
Chazelle’s triangulation [1] forms today the common basis for linear-time Euclidean shortest path (ESP) calculations (where start and end point are given within a simple polygon)...
98
Voted
COMPGEOM
1991
ACM
15 years 1 months ago
1991
ACM
We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle. Our main result is that a polygon with n sides can be triangulated with...
JCDCG
2000
Springer
15 years 1 months ago
2000
Springer
A k-dissection D of a polygon P, is a partition of P into a set of subpolygons {Q1, . . . , Qm} with disjoint interiors such that these can be reassembled to form k polygons P1, ....
81
Voted
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the ...