On the public citation graph
Iterated nearest neighbors and finding minimal polytopes
0 signed · 144 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.1006/jagm.1995.1048openalex-snapshot
Static and Dynamic Algorithms for k-Point Clustering Problems
inferredcites →https://doi.org/10.1007/3-540-57155-8_254openalex-snapshot
Static and dynamic algorithms for k-point clustering problems
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_3openalex-snapshot
A Combinatorial Problem in Geometry
inferredcites →https://doi.org/10.1007/978-1-4612-0963-8openalex-snapshot
Unsolved problems in geometry: unsolved problems in intuitive mathematics
inferredcites →https://doi.org/10.1007/bf02187718openalex-snapshot
AnO(n logn) algorithm for the all-nearest-neighbors Problem
inferredcites →https://doi.org/10.1007/bf02187852openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferredcites →https://doi.org/10.1007/bf02574012openalex-snapshot
Iterated nearest neighbors and finding minimal polytopes
inferredcites →https://doi.org/10.1016/0022-0000(82)90048-4openalex-snapshot
The complexity of selection and ranking in X + Y and matrices with sorted columns
inferredcites →https://doi.org/10.1016/0022-0000(89)90038-xopenalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1016/0196-6774(80)90015-2openalex-snapshot
Decomposable searching problems I. Static-to-dynamic transformation
inferredcites →https://doi.org/10.1016/0196-6774(91)90022-qopenalex-snapshot
Finding k points with minimum diameter and related problems
inferredcites →https://doi.org/10.1016/0925-7721(93)90024-zopenalex-snapshot
On vertical ray shooting in arrangements
inferredcites →https://doi.org/10.1016/s0022-0000(05)80064-9openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferredcites →https://doi.org/10.1109/fscs.1990.89594openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferredcites →https://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferredcites →https://doi.org/10.1109/sfcs.1992.267752openalex-snapshot
Enumerating the k closest pairs optimally
inferredcites →https://doi.org/10.1109/tc.1987.5009474openalex-snapshot
An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/0220065openalex-snapshot
New Upper Bounds in Klee’s Measure Problem
inferredcites →https://doi.org/10.1142/s0218195992000147openalex-snapshot
SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
inferredcites →https://doi.org/10.1145/100216.100259openalex-snapshot
Output sensitive construction of levels and Voronoi diagrams in R d of order 1 to k
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/7531.7537openalex-snapshot
Slowing down sorting networks to obtain faster sorting algorithms
inferredcites →https://doi.org/10.1145/98524.98532openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferredcites →https://doi.org/10.4153/cmb-1983-077-8openalex-snapshot
Sets with No Empty Convex 7-Gons
inferredcites →https://doi.org/10.5555/313559.313612openalex-snapshot
Iterated nearest neighbors and finding minimal polytypes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11575832_14openalex-snapshot
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
inferred← citeshttps://doi.org/10.1007/11764298_8openalex-snapshot
Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
inferred← citeshttps://doi.org/10.1007/11841036_37openalex-snapshot
Region-Restricted Clustering for Geographic Data Mining
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_23openalex-snapshot
Smallest Color-Spanning Objects
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_11openalex-snapshot
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_8openalex-snapshot
Translating a Planar Object to Maximize Point Containment
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_15openalex-snapshot
Efficient Approximation Algorithms for Multi-label Map Labeling
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_254openalex-snapshot
Static and dynamic algorithms for k-point clustering problems
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_5openalex-snapshot
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_76openalex-snapshot
Offset-polygon annulus placement problems
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_78openalex-snapshot
Geometric Applications of Posets
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_6openalex-snapshot
Randomized Algorithms for Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-48325-8_16openalex-snapshot
Heuristics for Computing k-Nearest Neighbors Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-58657-7_10openalex-snapshot
Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_13openalex-snapshot
Cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_17openalex-snapshot
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_46openalex-snapshot
On the k-colored Rainbow Sets in Fixed Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-031-09076-9_33openalex-snapshot
Finding Optimal Paths of All Lengths in Directed Grid Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_13openalex-snapshot
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-031-49611-0_16openalex-snapshot
A Novel Approximation Algorithm for Max-Covering Circle Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-13191-7_16openalex-snapshot
Intelligent Collision Avoidance between Autonomous Agents Using Adaptive Local Views
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_1514openalex-snapshot
Maximizing Range Sum in Spatial Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_14openalex-snapshot
An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_1514-1openalex-snapshot
Maximizing Range Sum in Spatial Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-44403-1_2openalex-snapshot
General Purpose Index-Based Method for Efficient MaxRS Query
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_27openalex-snapshot
Fast Algorithms for Computing the Smallest k-Enclosing Disc
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_57openalex-snapshot
Geodesic Disks and Clustering in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_1openalex-snapshot
Graph-Theoretic Solutions to Computational Geometry Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-21931-3_7openalex-snapshot
k-Enclosing Axis-Parallel Square
inferred← citeshttps://doi.org/10.1007/978-3-642-44927-7_13openalex-snapshot
A Human-Inspired Collision Avoidance Method for Multi-robot and Mobile Autonomous Robots
inferred← citeshttps://doi.org/10.1007/bf02570713openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1007/bf02574030openalex-snapshot
Dynamic Euclidean minimum spanning trees and extrema of binary functions
inferred← citeshttps://doi.org/10.1007/pl00009478openalex-snapshot
Geometric Applications of a Randomized Optimization Technique
inferred← citeshttps://doi.org/10.1007/s00371-003-0207-1openalex-snapshot
Automatic surface reconstruction with alpha-shape method
inferred← citeshttps://doi.org/10.1007/s00453-004-1123-0openalex-snapshot
Fast Algorithms for Computing the Smallest k-Enclosing Circle
inferred← citeshttps://doi.org/10.1007/s00454-020-00239-3openalex-snapshot
Smallest k-Enclosing Rectangle Revisited
inferred← citeshttps://doi.org/10.1007/s00454-026-00837-7openalex-snapshot
Finding a Maximum Clique in a Disk Graph
inferred← citeshttps://doi.org/10.1007/s10707-008-0055-2openalex-snapshot
Web data retrieval: solving spatial range queries using k-nearest neighbor searches
inferred← citeshttps://doi.org/10.1007/s10878-021-00790-6openalex-snapshot
Linear-size universal discretization of geometric center-based problems in fixed dimensions
inferred← citeshttps://doi.org/10.1007/s42489-022-00106-6openalex-snapshot
Visualizing the Off-Screen Evolution of Trajectories
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00190-aopenalex-snapshot
On enclosing k points by a circle
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00009-7openalex-snapshot
Algorithms for proximity problems in higher dimensions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50021-8openalex-snapshot
Closest-Point Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.05.001openalex-snapshot
Covering points with a polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.08.003openalex-snapshot
Region-restricted clustering for geographic data mining
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.01.007openalex-snapshot
A (slightly) faster algorithm for Klee's measure problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.01.007openalex-snapshot
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102269openalex-snapshot
Computing maximum cliques in unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.06.005openalex-snapshot
On finding a large number of 3D points with a small diameter
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.02.011openalex-snapshot
Complexity and approximation of the Smallest k -Enclosing Ball problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.09.019openalex-snapshot
A note on maximum independent sets in rectangle intersection graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.02.013openalex-snapshot
Smallest k-point enclosing rectangle and square of arbitrary orientation
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.04.006openalex-snapshot
A new approximation algorithm for labeling points with circle pairs
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.005openalex-snapshot
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
inferred← citeshttps://doi.org/10.1016/j.jda.2008.12.002openalex-snapshot
Algorithms for optimal outlier removal
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.038openalex-snapshot
The approximation algorithms for a class of multiple-choice problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115583openalex-snapshot
On k -enclosing slab problems
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00256-4openalex-snapshot
A simple factor-3 approximation for labeling points with circles
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00212-3openalex-snapshot
Enclosing k points in the smallest axis parallel rectangle
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00304-0openalex-snapshot
Compact location problems
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00013-4openalex-snapshot
Extending range queries and nearest neighbors
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00011-9openalex-snapshot
Translating a convex polygon to contain a maximum number of points
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00021-1openalex-snapshot
Faster geometric k-point MST approximation
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00015-7openalex-snapshot
Optimal placement of convex polygons to maximize point containment
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00025-xopenalex-snapshot
Offset-polygon annulus placement problems
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00031-5openalex-snapshot
Geometric applications of posets
inferred← citeshttps://doi.org/10.1023/a:1013326409918openalex-snapshot
New Approximation Algorithms for Map Labeling with Sliding Labels
inferred← citeshttps://doi.org/10.1080/00207160108805081openalex-snapshot
Minimum area polygons with two reflex angles enclosingkPoints
inferred← citeshttps://doi.org/10.1080/00207160211923openalex-snapshot
Computing the Smallest T-Shaped Polygon Containing k Points
inferred← citeshttps://doi.org/10.1093/imaiai/iaab013openalex-snapshot
Estimating location parameters in sample-heterogeneous distributions
inferred← citeshttps://doi.org/10.1109/bigdata66926.2025.11402464openalex-snapshot
Rapid Detection of the Smallest k-Minimum Bounding Rectangles for Moving Objects
inferred← citeshttps://doi.org/10.1109/focs.2013.51openalex-snapshot
Klee's Measure Problem Made Easy
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00059openalex-snapshot
A tight (non-combinatorial) conditional lower bound for Klee’s Measure Problem in 3D
inferred← citeshttps://doi.org/10.1109/icdcs.2011.69openalex-snapshot
Searching for Bandwidth-Constrained Clusters
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941652openalex-snapshot
K-enclosing square or rectangle problem revisited
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941660openalex-snapshot
Classical knapsack to geometric knapsack: A journey
inferred← citeshttps://doi.org/10.1109/igarss.2017.8126820openalex-snapshot
Colors in multimodal data: Dominant line extraction inspired by computer vision techniques
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646145openalex-snapshot
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
inferred← citeshttps://doi.org/10.1109/sisap.2009.33openalex-snapshot
Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph
inferred← citeshttps://doi.org/10.1134/s1064562413030253openalex-snapshot
Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center
inferred← citeshttps://doi.org/10.1134/s1990478913030186openalex-snapshot
The problem of a minimal ball enclosing k points
inferred← citeshttps://doi.org/10.1137/s0097539703427963openalex-snapshot
Shape Fitting with Outliers
inferred← citeshttps://doi.org/10.1142/s0218195900000334openalex-snapshot
QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS
inferred← citeshttps://doi.org/10.1142/s0218195901000584openalex-snapshot
EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
inferred← citeshttps://doi.org/10.1142/s0218195902000736openalex-snapshot
POINT SET LABELING WITH SPECIFIED POSITIONS
inferred← citeshttps://doi.org/10.1142/s0218195911003822openalex-snapshot
GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON
inferred← citeshttps://doi.org/10.1142/s0218195915500156openalex-snapshot
Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points
inferred← citeshttps://doi.org/10.1142/s0218195922410035openalex-snapshot
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
inferred← citeshttps://doi.org/10.1145/1064092.1064154openalex-snapshot
Covering points with a polygon
inferred← citeshttps://doi.org/10.1145/1377676.1377693openalex-snapshot
A (slightly) faster algorithm for klee's measure problem
inferred← citeshttps://doi.org/10.1145/177424.178039openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1145/256292.256294openalex-snapshot
Separators for sphere-packings and nearest neighbor graphs
inferred← citeshttps://doi.org/10.1145/276884.276915openalex-snapshot
Geometric applications of a randomized optimization technique
inferred← citeshttps://doi.org/10.1145/290179.290180openalex-snapshot
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.2172/918344openalex-snapshot
Algorithmic support for commodity-based parallel computing systems.
inferred← citeshttps://doi.org/10.22028/d291-23759openalex-snapshot
Geometric algorithms for object placement and planarity in a terrain
inferred← citeshttps://doi.org/10.22215/etd/2023-15445openalex-snapshot
Constrained Geometric Optimization Problems
inferred← citeshttps://doi.org/10.24215/16666038.18.e07openalex-snapshot
All Near Neighbor GraphWithout Searching
inferred← citeshttps://doi.org/10.3390/heritage6110366openalex-snapshot
A Quantitative Social Network Analysis of the Character Relationships in the Mahabharata
inferred← citeshttps://doi.org/10.4236/ajcm.2014.43016openalex-snapshot
Variations of Enclosing Problem Using Axis Parallel Square(s): A General Approach
inferred← citeshttps://doi.org/10.48550/arxiv.1907.03087openalex-snapshot
Estimating location parameters in entangled single-sample distributions
inferred← citeshttps://doi.org/10.5555/1873601.1873616openalex-snapshot
Counting inversions, offline orthogonal range counting, and related problems
inferred← citeshttps://doi.org/10.5555/314161.314250openalex-snapshot
Map labeling and its generalizations
inferred← citeshttps://doi.org/10.70675/a022ddcbz8047z488bzb33bz68f6b99639b2openalex-snapshot
Trustworthy machine learning : explainability and distribution-free uncertainty quantification
showing the first 109 of 110 · page through all 110
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.