Decomposition and intersection of simple splinegons

DOI10.1007/BF01762127zbMATH Open0648.68062OpenAlexW2051831392MaRDI QIDQ1105375FDOQ1105375

Authors: David P. Dobkin, Diane L. Souvaine, Christopher J. Van Wyk 

Publication date: 1988

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01762127

Recommendations

• scientific article; zbMATH DE number 2197927
• Efficient intersection between splines of clothoids
• On computational aspects of simplicial splines
• scientific article; zbMATH DE number 1284030
• On discrete simplex splines and subdivision
• scientific article; zbMATH DE number 2020193
• Publication:3469666
• Approximate convex decomposition of polygons
• Approximate convex decomposition of polygons
• scientific article; zbMATH DE number 1361568

zbMATH Keywords

computational geometrycurvesconvex decompositionintersection detectionsplinegonmonotone decompositionsimplicity testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal Search in Planar Subdivisions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Location of a Point in a Planar Subdivision and Its Applications
• Title not available (Why is that?)
• Triangulation and shape-complexity
• Triangulating Simple Polygons and Equivalent Problems
• Title not available (Why is that?)
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• Decomposing a Polygon into Simpler Components
• Title not available (Why is that?)
• Sorting jordan sequences in linear time using level-linked search trees
• Convex hulls of piecewise-smooth Jordan curves
• Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
• Decomposition of Polygons into Convex Sets

Cited In (15)

• Voronoi-based splinegon decomposition and shortest-path tree computation
• A general method for decomposing self-intersecting polygon to normal based on self-intersection points
• Self-intersecting polygons resulting from contour evolution for shape similarity
• Triangulating a simple polygon in linear time
• On determining optimal strategies in pursuit games in the plane
• Multi UAV coordination for tracking the dispersion of a contaminant cloud in an urban region
• Tiling polygons with parallelograms
• Fourth- and higher-order interface tracking via mapping and adjusting regular semianalytic sets represented by cubic splines
• Computational geometry in a curved world
• A tight bound for point guards in piecewise convex art galleries
• Detecting the intersection of convex objects in the plane
• Shortest curves in planar regions with curved boundary
• On determining optimal strategies in pursuit games in the plane
• Efficient one-sided linearization of spline geometry
• Computing an \(L_1\) shortest path among splinegonal obstacles in the plane

This page was built for publication: Decomposition and intersection of simple splinegons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105375)