ZIB

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

Decomposition and intersection of simple splinegons (1988)

Dobkin, David P. ; Souvaine, Diane L. ; Wyk, Christopher J.

Springer

Algorithmica 3 (1988), S. 473-485

add to mindlist on the mindlist

Details

ISSN: 1432-0541

Keywords: Computational geometry ; Curves ; Simplicity testing ; Intersection detection ; Monotone decomposition ; Convex decomposition

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract A splinegon is a polygon whose edges have been replaced by “well-behaved” curves. We show how to decompose a simple splinegon into a union of monotone pieces and into a union of differences of unions of convex pieces. We also show how to use a fast triangulation algorithm to test whether two given simple splinegons intersect. We conclude with examples of splinegons that make the extension of algorithms from polygons to splinegons difficult.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01762127

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit