On the public citation graph

Approximation of convex polygons

https://doi.org/10.1007/bfb0032068
0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-0348-5858-8_7openalex-snapshot
Approximation of convex bodies
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1016/b978-0-444-70467-2.50011-4openalex-snapshot
Polygonal Approximations of a Curve — Formulations and Algorithms
inferredcites →https://doi.org/10.1016/b978-0-444-70467-2.50012-6openalex-snapshot
On Polygonal Chain Approximation
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1996.0057openalex-snapshot
Enclosing a Set of Objects by Two Minimum Area Rectangles
inferred← citeshttps://doi.org/10.1007/11602613_88openalex-snapshot
Stacking and Bundling Two Convex Polygons
inferred← citeshttps://doi.org/10.1007/3-540-54891-2_2openalex-snapshot
An optimal algorithm for approximating a set of rectangles by two minimum area rectangles
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_59openalex-snapshot
Approximating polygons and subdivisions with minimum link paths
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_19openalex-snapshot
Resemblance and symmetries of geometric patterns
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_20openalex-snapshot
Approximations with axis-aligned rectangles (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_65openalex-snapshot
Matching convex shapes with respect to the symmetric difference
inferred← citeshttps://doi.org/10.1007/978-1-4471-3702-3_4openalex-snapshot
State of the Art in Shape Matching
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_5openalex-snapshot
Large k-Gons in a 1.5D Terrain
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_6openalex-snapshot
Polygonal Path Approximation: A Query Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_19openalex-snapshot
Distance-Preserving Approximations of Polygonal Paths
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_29openalex-snapshot
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon
inferred← citeshttps://doi.org/10.1007/bf01530830openalex-snapshot
Approximate matching of polygonal shapes
inferred← citeshttps://doi.org/10.1007/bfb0020793openalex-snapshot
A natural metric for curves — Computing the distance for polygonal chains and approximation algorithms
inferred← citeshttps://doi.org/10.1007/pl00009210openalex-snapshot
Matching Convex Shapes with Respect to the Symmetric Difference
inferred← citeshttps://doi.org/10.1007/s00224-013-9493-9openalex-snapshot
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
inferred← citeshttps://doi.org/10.1007/s00453-003-1042-5openalex-snapshot
Comparison of Distance Measures for Planar Curves
inferred← citeshttps://doi.org/10.1007/s00453-003-1046-1openalex-snapshot
New Results on Path Approximation
inferred← citeshttps://doi.org/10.1007/s00453-010-9466-1openalex-snapshot
Aligning Two Convex Figures to Minimize Area or Perimeter
inferred← citeshttps://doi.org/10.1007/s10958-008-9144-xopenalex-snapshot
Approximation of convex sets by polytopes
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00079-4openalex-snapshot
Computing a maximum axis-aligned rectangle in a convex polygon
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50004-8openalex-snapshot
Discrete Geometric Shapes: Matching, Interpolation, and Approximation**Partially supported by Deutsche Forschungsgemeinschaft (DFG), Grant No. A1 253/4-2.
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.07.001openalex-snapshot
Polygonal chain approximation: a query based approach
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.09.003openalex-snapshot
Polygonal path simplification with angle constraints
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.06.001openalex-snapshot
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.01.005openalex-snapshot
Maximizing the overlap of two planar convex sets under rigid motions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.05.002openalex-snapshot
Distance-preserving approximations of polygonal paths
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.01.002openalex-snapshot
Shape matching under rigid motion
inferred← citeshttps://doi.org/10.1016/j.jda.2005.06.008openalex-snapshot
Area-preserving approximations of polygonal paths
inferred← citeshttps://doi.org/10.1080/23729333.2025.2561407openalex-snapshot
Summarizing classed region maps with a disk choreme
inferred← citeshttps://doi.org/10.1145/1064092.1064146openalex-snapshot
Maximizing the overlap of two planar convex sets under rigid motions
inferred← citeshttps://doi.org/10.1145/109648.109669openalex-snapshot
Approximate matching of polygonal shapes (extended abstract)
inferred← citeshttps://doi.org/10.1145/142675.142699openalex-snapshot
Measuring the resemblance of polygonal curves
inferred← citeshttps://doi.org/10.1145/2502524.2502535openalex-snapshot
Spatio-temporal hybrid automata for safe cyber-physical systems
inferred← citeshttps://doi.org/10.14711/thesis-b1198608openalex-snapshot
Shape matching under rigid motion
inferred← citeshttps://doi.org/10.1515/form.2001.012openalex-snapshot
Dropping a vertex or a facet from a convex polytope
inferred← citeshttps://doi.org/10.17169/refubium-17176openalex-snapshot
Shape Matching With Reference Points
inferred← citeshttps://doi.org/10.3233/fi-1995-2243openalex-snapshot
TENTATIVE PRUNE-AND-SEARCH FOR COMPUTING FIXED-POINTS WITH APPLICATIONS TO GEOMETRIC COMPUTATION
inferred← citeshttps://doi.org/10.3990/1.9789036528580openalex-snapshot
Diagnosis, synthesis and analysis of probabilistic models
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13246openalex-snapshot
Largest Inscribed Rectangles in Geometric Convex Sets
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0009013openalex-snapshot
Pattern Matching for sets of segments
inferred← citeshttps://doi.org/10.5555/365411.365463openalex-snapshot
Pattern matching for sets of segments
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.