Decomposition and intersection of simple splinegons
type: Item
instance of: scholarly article
title: Decomposition and intersection of simple splinegons
zbMATH Open document ID: 0648.68062
DOI: 10.1007/BF01762127
author: David P. Dobkin
author: Diane L. Souvaine
author: Christopher J. Van Wyk
published in: Algorithmica
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 4058870
zbMATH Keywords: computational geometry
zbMATH Keywords: simplicity testing
zbMATH Keywords: intersection detection
zbMATH Keywords: monotone decomposition
zbMATH Keywords: convex decomposition
zbMATH Keywords: splinegon
zbMATH Keywords: curves
MaRDI profile type: Publication
cites work: Q3750120
cites work: Triangulation and shape-complexity
cites work: Q5520521
cites work: Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
cites work: Triangulating Simple Polygons and Equivalent Problems
cites work: Q5508167
cites work: Sorting jordan sequences in linear time using level-linked search trees
cites work: Decomposing a Polygon into Simpler Components
cites work: Q3693476
cites work: Optimal Search in Planar Subdivisions
cites work: Location of a Point in a Planar Subdivision and Its Applications
cites work: Q3776623
cites work: Q5802785
cites work: Q3992847
cites work: Decomposition of Polygons into Convex Sets
cites work: Convex hulls of piecewise-smooth Jordan curves
cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
full work available at URL: https://doi.org/10.1007/bf01762127
OpenAlex ID: W2051831392
Recommended article: Q5466070
Recommended article: Efficient intersection between splines of clothoids
Recommended article: On computational aspects of simplicial splines
Recommended article: Q4240375
Recommended article: On discrete simplex splines and subdivision
Recommended article: Q4440842
Recommended article: Q3469666
Recommended article: Approximate convex decomposition of polygons
Recommended article: Q4699391
description: scientific article; zbMATH DE number 4058870