On the public citation graph
Complexity, convexity, and unimodality
0 signed · 55 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/978-94-009-7772-3_7openalex-snapshot
Computational Geometric Problems in Pattern Recognition
inferredcites →https://doi.org/10.1016/0020-0190(76)90073-9openalex-snapshot
Information Processing Letters
inferredcites →https://doi.org/10.1016/0020-0190(78)90066-2openalex-snapshot
The all nearest-neighbor problem for convex polygons
inferredcites →https://doi.org/10.1016/0020-0190(79)90021-8openalex-snapshot
A note on the all nearest-neighbor problem for convex polygons
inferredcites →https://doi.org/10.1016/0020-0190(81)90091-0openalex-snapshot
Testing a simple polygon for monotonicity
inferredcites →https://doi.org/10.1016/0031-3203(72)90016-7openalex-snapshot
Representation of figures by labeled graphs
inferredcites →https://doi.org/10.1016/0031-3203(80)90066-7openalex-snapshot
The relative neighbourhood graph of a finite planar set
inferredcites →https://doi.org/10.1016/0146-664x(74)90009-4openalex-snapshot
Concavity Point Detection by Iterative Arrays
inferredcites →https://doi.org/10.1016/0898-1221(82)90054-2openalex-snapshot
On the multimodality of distances in convex polygons
inferredcites →https://doi.org/10.1016/0898-1221(83)90139-6openalex-snapshot
The symmetric all-furthest- neighbor problem
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50008-6openalex-snapshot
On Geometric Algorithms that use the Furthest-Point Voronoi Diagram
inferredcites →https://doi.org/10.1080/00029890.1952.11988075openalex-snapshot
On The Different Distances Determined By n Points
inferredcites →https://doi.org/10.1080/00029890.1963.11990057openalex-snapshot
On a Problem of P. Erdös
inferredcites →https://doi.org/10.1109/sfcs.1979.28openalex-snapshot
On a general method for maximizing and minimizing among certain geometric problems
inferredcites →https://doi.org/10.1109/tc.1978.1675001openalex-snapshot
Decomposition of Polygons into Convex Sets
inferredcites →https://doi.org/10.1109/tpami.1980.4767016openalex-snapshot
Finding the Extrema of a Region
inferredcites →https://doi.org/10.1109/tpami.1982.4767248openalex-snapshot
A Counterexample to a Diameter Algorithm for Convex Polygons
inferredcites →https://doi.org/10.1109/tsmc.1971.4308328openalex-snapshot
Concavity Extraction by Parallel Processing
inferredcites →https://doi.org/10.1145/2402.322386openalex-snapshot
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1421openalex-snapshot
Time-Optimal Proximity Graph Computations on Enhanced Meshes
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_96openalex-snapshot
Time-optimal nearest-neighbor computations on enhanced meshes
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_24openalex-snapshot
Some Collision Avoidance Problems in the Plane
inferred← citeshttps://doi.org/10.1007/bf01840359openalex-snapshot
Geometric applications of a matrix-searching algorithm
inferred← citeshttps://doi.org/10.1007/bf01898356openalex-snapshot
A unifying approach for a class of problems in the computational geometry of polygons
inferred← citeshttps://doi.org/10.1007/bf02187802openalex-snapshot
On the modality of convex polygons
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90101-3openalex-snapshot
On determining the on-line minimax linear fit to a discrete point set in the plane
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90226-8openalex-snapshot
On the unimodality of convex polygons
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90081-1openalex-snapshot
A simple linear-time algorithm for computing the RNG and MST of unimodal polygons
inferred← citeshttps://doi.org/10.1016/0167-8655(93)90146-5openalex-snapshot
A unimodal counterexample to a diameter algorithm
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90005-7openalex-snapshot
Finding the smallest triangles containing a given convex polygon
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90028-3openalex-snapshot
Fast computation of the modality of polygons
inferred← citeshttps://doi.org/10.1016/0898-1221(83)90139-6openalex-snapshot
The symmetric all-furthest- neighbor problem
inferred← citeshttps://doi.org/10.1016/0898-1221(85)90109-9openalex-snapshot
Finding the minimum vertex distance between two disjoint convex polygons in linear time
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90154-aopenalex-snapshot
The morphology of convex polygons
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50018-9openalex-snapshot
Movable Separability of Sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.03.004openalex-snapshot
Algorithms for optimal area triangulations of a convex polygon
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.008openalex-snapshot
Algorithms for k -dispersion for points in convex position in the plane
inferred← citeshttps://doi.org/10.1016/j.ijepes.2024.109870openalex-snapshot
An enhanced method for fault location in distribution systems based on optimal power flow
inferred← citeshttps://doi.org/10.1016/s0734-189x(86)80059-7openalex-snapshot
Picture processing: 1985
inferred← citeshttps://doi.org/10.1080/00207169008803885openalex-snapshot
Constructing bimodal convex hexagons
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/34.295902openalex-snapshot
Collision detection of a moving polygon in the presence of polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1109/icenco49778.2020.9357380openalex-snapshot
K-Means Tree for Fast Furthest Neighbor Approximation
inferred← citeshttps://doi.org/10.1109/tit.1984.1056845openalex-snapshot
A new linear convex hull algorithm for simple polygons (Corresp.)
inferred← citeshttps://doi.org/10.1145/10515.10546openalex-snapshot
Geometric applications of a matrix searching algorithm
inferred← citeshttps://doi.org/10.1145/73833.73861openalex-snapshot
Determining sector visibility of a polygon
inferred← citeshttps://doi.org/10.1287/ijoc.12.4.317.11880openalex-snapshot
Approximation of Point Sets by 1-Corner Polygonal Chains
inferred← citeshttps://doi.org/10.17781/p001290openalex-snapshot
APPLICATIONS OF THE ROTATING CALIPERS TO GEOMETRIC PROBLEMS IN TWO AND THREE DIMENSIONS
inferred← citeshttps://doi.org/10.20868/upm.thesis.23321openalex-snapshot
Aerodynamic Optimization of the Nose Shape of a High-speed Train
inferred← citeshttps://doi.org/10.48550/arxiv.math/0609698openalex-snapshot
Convexity of Sub-polygons of Convex Polygons
inferred← citeshttps://doi.org/10.55630/sjc.2010.4.335-348openalex-snapshot
Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons
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.