On the public citation graph
Polygonizations of point sets in the plane
0 signed · 37 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02187887openalex-snapshot
A lower bound for the optimal crossing-free Hamiltonian cycle problem
inferredcites →https://doi.org/10.1016/0020-0190(72)90045-2openalex-snapshot
An efficient algorith for determining the convex hull of a finite planar set
inferredcites →https://doi.org/10.1016/0146-664x(78)90115-6openalex-snapshot
A review of algorithms for shape analysis
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1016/s0146-664x(74)80004-3openalex-snapshot
Computing the perceptual boundaries of dot patterns
inferredcites →https://doi.org/10.1016/s0734-189x(87)80169-xopenalex-snapshot
Connect-the-dots: A new heuristic
inferredcites →https://doi.org/10.1109/sfcs.1983.11openalex-snapshot
Constructing arrangements of lines and hyperplanes with applications
inferredcites →https://doi.org/10.1109/sfcs.1983.17openalex-snapshot
Filtering search: A new approach to query-answering
inferredcites →https://doi.org/10.1109/t-c.1971.223083openalex-snapshot
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
inferredcites →https://doi.org/10.1109/tpami.1982.4767255openalex-snapshot
Dot Pattern Processing Using Voronoi Neighborhoods
inferredcites →https://doi.org/10.1145/10515.10521openalex-snapshot
On computing simple circuits on a set of line segments
inferredcites →https://doi.org/10.1145/10515.10544openalex-snapshot
Quadratic bounds for hidden line elimination
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/358656.358681openalex-snapshot
Plane-sweep algorithms for intersecting geometric figures
inferredcites →https://doi.org/10.1145/359423.359430openalex-snapshot
Convex hulls of finite sets of points in two and three dimensions
inferredcites →https://doi.org/10.1145/800061.808751openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_27openalex-snapshot
Many Views of Planar Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_10openalex-snapshot
On the Number of Radial Orderings of Colored Planar Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_14openalex-snapshot
Spiral Serpentine Polygonization of a Planar Point Set
inferred← citeshttps://doi.org/10.1016/j.rcim.2013.09.004openalex-snapshot
OCOG: A common grasp computation algorithm for a set of planar objects
inferred← citeshttps://doi.org/10.1109/atit49449.2019.9030463openalex-snapshot
The "Divide and Conquer" technique to solve the Minimum Area Polygonalization problem
inferred← citeshttps://doi.org/10.1137/050636036openalex-snapshot
On the Number of Crossing‐Free Matchings, Cycles, and Partitions
inferred← citeshttps://doi.org/10.1145/2896849openalex-snapshot
An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets
inferred← citeshttps://doi.org/10.1177/02783649231182486openalex-snapshot
Simple kinesthetic haptics for object recognition
inferred← citeshttps://doi.org/10.1214/16-aos1450openalex-snapshot
Monge–Kantorovich depth, quantiles, ranks and signs
inferred← citeshttps://doi.org/10.1920/wp.cem.2015.5715openalex-snapshot
Monge-Kantorovich depth, quantiles, ranks and signs
inferred← citeshttps://doi.org/10.2197/ipsjjip.33.954openalex-snapshot
Computational Complexities of Folding
inferred← citeshttps://doi.org/10.2466/pms.108.1.37-42openalex-snapshot
Pairwise Comparisons and Visual Perceptions of Equal Area Polygons
inferred← citeshttps://doi.org/10.46298/dmtcs.2087openalex-snapshot
On the numbers of radial orderings of planar point sets
inferred← citeshttps://doi.org/10.47749/t/unicamp.2018.994025openalex-snapshot
Formulações e algoritmos para o problema da poligonização de área máxima
inferred← citeshttps://doi.org/10.48550/arxiv.1204.0547openalex-snapshot
On the number of radial orderings of planar point sets
inferred← citeshttps://doi.org/10.5555/1109557.1109652openalex-snapshot
On the number of crossing-free matchings, (cycles, and partitions)
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.