On the public citation graph
Partitioning arrangements of lines I: An efficient deterministic algorithm
0 signed · 74 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-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187685openalex-snapshot
Halfspace range search: An algorithmic application ofk-sets
inferredcites →https://doi.org/10.1007/bf02187686openalex-snapshot
More onk-sets of finite sets in the plane
inferredcites →https://doi.org/10.1007/bf02187741openalex-snapshot
A fast las vegas algorithm for triangulating a simple polygon
inferredcites →https://doi.org/10.1007/bf02187742openalex-snapshot
Implicitly representing arrangements of lines or segments
inferredcites →https://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferredcites →https://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
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.1038/190864b0openalex-snapshot
Journal of the Association for Computing Machinery
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.1137/0215019openalex-snapshot
Constructing Belts in Two-Dimensional Arrangements with Applications
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/0218055openalex-snapshot
An Optimal-Time Algorithm for Slope Selection
inferredcites →https://doi.org/10.1137/0219020openalex-snapshot
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
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/22145.22165openalex-snapshot
A probabilistic algorithm for the post office problem
inferredcites →https://doi.org/10.1145/73007.73045openalex-snapshot
Polling: a new randomized sampling technique for computational geometry
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73395openalex-snapshot
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
inferredcites →https://doi.org/10.1145/7531.7537openalex-snapshot
Slowing down sorting networks to obtain faster sorting algorithms
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-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_19openalex-snapshot
Approximating the k-Level in Three-Dimensional Plane Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_6openalex-snapshot
Plane Bichromatic Trees of Low Degree
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_41openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles
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-58043-7_4openalex-snapshot
Epsilon-Nets and Computational Geometry
inferred← citeshttps://doi.org/10.1007/bf01187036openalex-snapshot
Ray shooting on triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bf01293267openalex-snapshot
An improved technique for output-sensitive hidden surface removal
inferred← citeshttps://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferred← citeshttps://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferred← citeshttps://doi.org/10.1007/bf02189304openalex-snapshot
Applications of a new space-partitioning technique
inferred← citeshttps://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferred← citeshttps://doi.org/10.1007/bf02523679openalex-snapshot
On counting pairs of intersecting segments and off-line triangle range searching
inferred← citeshttps://doi.org/10.1007/bf02573972openalex-snapshot
Range searching with efficient hierarchical cuttings
inferred← citeshttps://doi.org/10.1007/bf02573985openalex-snapshot
An optimal convex hull algorithm in any fixed dimension
inferred← citeshttps://doi.org/10.1007/pl00009325openalex-snapshot
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming
inferred← citeshttps://doi.org/10.1007/s00454-009-9158-2openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles in Three-Space
inferred← citeshttps://doi.org/10.1007/s00454-010-9323-7openalex-snapshot
A Non-linear Lower Bound for Planar Epsilon-nets
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/s00454-017-9881-zopenalex-snapshot
Plane Bichromatic Trees of Low Degree
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.comgeo.2012.10.004openalex-snapshot
Space/query-time tradeoff for computing the visibility polygon
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.11.015openalex-snapshot
Computing closest and farthest points for a query segment
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.1109/12.376174openalex-snapshot
On computing connected components of line segments
inferred← citeshttps://doi.org/10.1109/focs.2010.39openalex-snapshot
A Non-linear Lower Bound for Planar Epsilon-Nets
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.1137/0221035openalex-snapshot
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
inferred← citeshttps://doi.org/10.1145/1016028.1016030openalex-snapshot
Managing uncertainty in moving objects databases
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/142675.142732openalex-snapshot
Range searching with efficient hierarchical cuttings
inferred← citeshttps://doi.org/10.1145/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
inferred← citeshttps://doi.org/10.1145/235666.571627openalex-snapshot
Computational Geometry Column 29
inferred← citeshttps://doi.org/10.1145/3747591openalex-snapshot
Minimum Plane Bichromatic Spanning Trees
inferred← citeshttps://doi.org/10.1145/73833.73835openalex-snapshot
A deterministic algorithm for partitioning arrangements of lines and its application
inferred← citeshttps://doi.org/10.48550/arxiv.1706.05412openalex-snapshot
A Practical Algorithm for Enumerating Collinear Points
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.