APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS

DOI10.1142/S0218195993000257MaRDI QIDQ4289634zbMATH OpenOpenAlexFDO

Authors Joseph S. B. Mitchell, Jack Snoeyink, Leonidas Guibas, John Hershberger

Publication date 2 January 1995

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195993000257

zbMATH Keywords

polygonal approximationcurve segmentationFréchet metriccartographic line simplificationlink metric

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Efficient algorithms for approximating polygonal chains
• Area-preserving approximations of polygonal paths
• Simplifying a polygonal subdivision while keeping it simple
• Polygonal chain approximation: A query based approach

Cited in

(37)

• Structured discrete shape approximation: theoretical complexity and practical algorithm
• Place the vertices anywhere on the curve and simplify
• scientific article; zbMATH DE number 7559218 (Why is no real title available?)
• Global Curve Simplification
• Computing instance-optimal kernels in two dimensions
• Simplifying a polygonal subdivision while keeping it simple
• Polygonal chain approximation: A query based approach
• Streaming algorithms for line simplification
• A graph theoretical approach to the firebreak locating problem
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• On the computational complexity of Roman\(\{2\}\)-domination in grid graphs
• Distance-preserving approximations of polygonal paths
• Touring a sequence of disjoint polygons: complexity and extension
• Computing homotopic line simplification
• Fréchet Distance for Uncertain Curves
• Minimum-link \(C\)-oriented paths visiting a sequence of regions in the plane
• Separation and approximation of polyhedral objects
• Fitting a two-joint orthogonal chain to a point set
• Roman domination in subgraphs of grids
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
• Fréchet distance for uncertain curves
• Edges and switches, tunnels and bridges
• Continuous location of dimensional structures.
• Optimization for first order Delaunay triangulations
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
• Area-preserving approximations of polygonal paths
• Route-enabling graph orientation problems
• Minimum-complexity graph simplification under the Fréchet-like distance
• Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
• New limits of treewidth-based tractability in optimization
• Dynamic L-budget clustering of curves
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
• Polygonal path simplification with angle constraints
• Fréchet edit distance
• Constructing pairwise disjoint paths with few links
• Efficient observer-dependent simplification in polygonal domains

This page was built for publication: APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS

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