On the public citation graph
Construction of ɛ-nets
0 signed · 101 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-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187686openalex-snapshot
More onk-sets of finite sets in the plane
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187742openalex-snapshot
Implicitly representing arrangements of lines or segments
inferredcites →https://doi.org/10.1007/bf02187743openalex-snapshot
Quasi-optimal range searching in spaces of finite VC-dimension
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1016/0734-189x(86)90127-1openalex-snapshot
A linear time algorithm for minimum link paths inside a simple polygon
inferredcites →https://doi.org/10.1109/sfcs.1988.21970openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferredcites →https://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferredcites →https://doi.org/10.1109/sfcs.1989.63458openalex-snapshot
An upper bound on the number of planar k-sets
inferredcites →https://doi.org/10.1137/0215019openalex-snapshot
Constructing Belts in Two-Dimensional Arrangements with Applications
inferredcites →https://doi.org/10.1137/0218055openalex-snapshot
An Optimal-Time Algorithm for Slope Selection
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
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/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73397openalex-snapshot
Partition trees for triangle counting and other range searching problems
inferredcites →https://doi.org/10.1145/73833.73835openalex-snapshot
A deterministic algorithm for partitioning arrangements of lines and its application
inferredcites →https://doi.org/10.1145/73833.73868openalex-snapshot
Ray shooting and other applications of spanning trees with low stabbing number
inferredcites →https://doi.org/10.1145/7531.7537openalex-snapshot
Slowing down sorting networks to obtain faster sorting algorithms
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
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.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_3openalex-snapshot
Irregularities of Distribution, Derandomization, and Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_174openalex-snapshot
Computational geometry for the gourmet old fare and new dishes
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_1openalex-snapshot
Simplex Range Searching and Its Variants: A Review
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_19openalex-snapshot
Approximating the k-Level in Three-Dimensional Plane Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_29openalex-snapshot
CS Unplugged—How Is It Used, and Does It Work?
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_14openalex-snapshot
Space–Query-Time Tradeoff for Computing the Visibility Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_8openalex-snapshot
A Simple Framework for the Generalized Nearest Neighbor Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_8openalex-snapshot
Optimal Algorithms for Constrained 1-Center Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_4openalex-snapshot
Epsilon-Nets and Computational Geometry
inferred← citeshttps://doi.org/10.1007/bf01285815openalex-snapshot
The number of edges of many faces in a line segment arrangement
inferred← citeshttps://doi.org/10.1007/bf01931656openalex-snapshot
Storing line segments in partition trees
inferred← citeshttps://doi.org/10.1007/bf01955043openalex-snapshot
Lines in Space: Combinatorics and Algorithms
inferred← citeshttps://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferred← citeshttps://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferred← citeshttps://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferred← citeshttps://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferred← citeshttps://doi.org/10.1007/bf02570718openalex-snapshot
Almost optimal set covers in finite VC-dimension
inferred← citeshttps://doi.org/10.1007/bf02574376openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1007/s00453-006-1229-7openalex-snapshot
Motorcycle Graphs and Straight Skeletons
inferred← citeshttps://doi.org/10.1007/s00453-016-0246-4openalex-snapshot
Ham-Sandwich Cuts for Abstract Order Types
inferred← citeshttps://doi.org/10.1007/s00454-001-0089-9openalex-snapshot
Visibility Queries and Maintenance in Simple Polygons
inferred← citeshttps://doi.org/10.1007/s00454-010-9248-1openalex-snapshot
Relative (p,ε)-Approximations in Geometry
inferred← citeshttps://doi.org/10.1007/s00454-012-9464-yopenalex-snapshot
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing
inferred← citeshttps://doi.org/10.1007/s00454-016-9784-4openalex-snapshot
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90076-topenalex-snapshot
On disjoint concave chains in arrangements of (pseudo) lines
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00057-3openalex-snapshot
On disjoint concave chains in arrangements of (pseudo) lines
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50014-0openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50017-6openalex-snapshot
Randomized Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.cageo.2014.05.010openalex-snapshot
Surface roughness of rock faces through the curvature of triangulated meshes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.10.004openalex-snapshot
Space/query-time tradeoff for computing the visibility polygon
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80068-6openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00004-1openalex-snapshot
The common exterior of convex polygons in the plane
inferred← citeshttps://doi.org/10.1023/a:1009857410665openalex-snapshot
Fast Range Searching with Delaunay Triangulations
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366847openalex-snapshot
Product range spaces, sensitive sampling, and derandomization
inferred← citeshttps://doi.org/10.1137/0221035openalex-snapshot
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
inferred← citeshttps://doi.org/10.1137/s0097539796260321openalex-snapshot
Product Range Spaces, Sensitive Sampling, and Derandomization
inferred← citeshttps://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferred← citeshttps://doi.org/10.1145/109648.109650openalex-snapshot
Counting circular arc intersections
inferred← citeshttps://doi.org/10.1145/1340771.1340776openalex-snapshot
Detecting cuts in sensor networks
inferred← citeshttps://doi.org/10.1145/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1145/1706591.1706596openalex-snapshot
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
inferred← citeshttps://doi.org/10.1145/177424.178029openalex-snapshot
Almost optimal set covers in finite VC-dimension
inferred← citeshttps://doi.org/10.1145/1998196.1998215openalex-snapshot
A center transversal theorem for hyperplanes and applications to graph drawing
inferred← citeshttps://doi.org/10.1145/235666.571627openalex-snapshot
Computational Geometry Column 29
inferred← citeshttps://doi.org/10.1145/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
inferred← citeshttps://doi.org/10.1145/98524.98530openalex-snapshot
How to net a lot with little: small ε-nets for disks and halfspaces
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2018.53openalex-snapshot
Extending the Centerpoint Theorem to Multiple Points
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3154openalex-snapshot
Epsilon-Nets for Halfspaces Revisited
inferred← citeshttps://doi.org/10.5555/338219.338602openalex-snapshot
Approximation algorithms for layered manufacturing
inferred← citeshttps://doi.org/10.5555/545381.545401openalex-snapshot
Motorcycle graphs and straight skeletons
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.