6 search results - page 1 / 2 » Decomposing a Simple Polygon into Trapezoids |
CAIP
2007
Springer
13 years 10 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)...
COMGEO
2008
ACM
13 years 4 months ago
2008
ACM
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
SSDBM
2000
IEEE
13 years 9 months ago
2000
IEEE
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
—Target shape matching can be used as a quick and easy surrogate task when evaluating optimization algorithms intended for computationally expensive tasks, such as turbine blade ...