On the public citation graph

On Constants for Cuttings in the Plane

0 signed · 41 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-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-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02122778openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferredcites →https://doi.org/10.1007/bf02187876openalex-snapshot
ɛ-nets and simplex range queries
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferredcites →https://doi.org/10.1007/bf02573985openalex-snapshot
An optimal convex hull algorithm in any fixed dimension
inferredcites →https://doi.org/10.1007/bf02573988openalex-snapshot
A bound on local minima of arrangements that implies the upper bound theorem
inferredcites →https://doi.org/10.1017/cbo9780511617331openalex-snapshot
Integral Geometry and Geometric Probability
inferredcites →https://doi.org/10.1090/dimacs/006/01openalex-snapshot
Geometric partitioning and its applications
inferredcites →https://doi.org/10.1109/sfcs.1993.366847openalex-snapshot
Product range spaces, sensitive sampling, and derandomization
inferredcites →https://doi.org/10.1137/0215019openalex-snapshot
Constructing Belts in Two-Dimensional Arrangements with Applications
inferredcites →https://doi.org/10.1137/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
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.1137/s009753979426616xopenalex-snapshot
Computing Many Faces in Arrangements of Lines and Segments
inferredcites →https://doi.org/10.1137/s0097539796260321openalex-snapshot
Product Range Spaces, Sensitive Sampling, and Derandomization
inferredcites →https://doi.org/10.1145/10515.10522openalex-snapshot
Epsilon-nets and simplex range queries
inferredcites →https://doi.org/10.1145/177424.177548openalex-snapshot
Computing many faces in arrangements of lines and segments
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73429openalex-snapshot
Algorithms for vertical and orthogonal L1 linear approximation of points
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.1007/978-3-319-44479-6openalex-snapshot
A Journey Through Discrete Mathematics
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-44479-6_21openalex-snapshot
Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_32openalex-snapshot
Partially Specified Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/pl00009478openalex-snapshot
Geometric Applications of a Randomized Optimization Technique
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.1007/s00493-017-3564-5openalex-snapshot
A Simple Proof of Optimal Epsilon Nets
inferred← citeshttps://doi.org/10.1016/j.apm.2007.07.008openalex-snapshot
A research note on design of fair surfaces over irregular domains using data-dependent triangulation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.12.002openalex-snapshot
Tighter estimates for ϵ-nets for disks
inferred← citeshttps://doi.org/10.1090/surv/173/08openalex-snapshot
Sampling and the moments technique
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814582openalex-snapshot
Taking a walk in a planar arrangement
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch83openalex-snapshot
Approximating the k-Level in Three-Dimensional Plane Arrangements
inferred← citeshttps://doi.org/10.1137/s0097539799350232openalex-snapshot
Constructing Planar Cuttings in Theory and Practice
inferred← citeshttps://doi.org/10.1137/s0097539799362627openalex-snapshot
Taking a Walk in a Planar Arrangement
inferred← citeshttps://doi.org/10.1145/276884.276915openalex-snapshot
Geometric applications of a randomized optimization technique
inferred← citeshttps://doi.org/10.1145/276884.276921openalex-snapshot
Constructing cuttings in theory and practice
inferred← citeshttps://doi.org/10.1145/777792.777798openalex-snapshot
Shape fitting with outliers
inferred← citeshttps://doi.org/10.48550/arxiv.1501.03246openalex-snapshot
Tighter Estimates for epsilon-nets for Disks
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.