On the public citation graph
Partitioning arrangements of lines II: Applications
0 signed · 121 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-83539-1_11openalex-snapshot
Reporting and Counting Intersections Between Two Sets of Line Segments
inferredcites →https://doi.org/10.1007/bf01182771openalex-snapshot
Algorithms for bichromatic line-segment problems and polyhedral terrains
inferredcites →https://doi.org/10.1007/bf01840441openalex-snapshot
Fractional cascading: II. Applications
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.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferredcites →https://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bf02579194openalex-snapshot
Extremal problems in discrete geometry
inferredcites →https://doi.org/10.1007/bf02788872openalex-snapshot
A theorem on arrangements of lines in the plane
inferredcites →https://doi.org/10.1016/0022-0000(86)90025-5openalex-snapshot
Reporting and counting segment intersections
inferredcites →https://doi.org/10.1016/0022-0000(89)90038-xopenalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1016/0097-3165(86)90078-6openalex-snapshot
On the maximal number of edges of many faces in an arrangement
inferredcites →https://doi.org/10.1016/0196-6774(92)90021-4openalex-snapshot
Good splitters for counting points in triangles
inferredcites →https://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot
Visibility problems for polyhedral terrains
inferredcites →https://doi.org/10.1090/s0894-0347-1989-1001852-0openalex-snapshot
Lower Bounds on the Complexity of Polytope Range Searching
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.1988.21974openalex-snapshot
A fast planar partition algorithm. I
inferredcites →https://doi.org/10.1109/sfcs.1988.21975openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1109/tc.1981.6312179openalex-snapshot
Comments on “algorithms for reporting and counting geometric intersections”
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0215019openalex-snapshot
Constructing Belts in Two-Dimensional Arrangements with Applications
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
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/10515.10544openalex-snapshot
Quadratic bounds for hidden line elimination
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/147508.147511openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1145/27625.27627openalex-snapshot
Worst-case optimal hidden-surface removal
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
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/73393.73399openalex-snapshot
The complexity of many faces in arrangements of lines of segments
inferredcites →https://doi.org/10.1145/73833.73847openalex-snapshot
Good splitters for counting points in triangles
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.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20025openalex-snapshot
Data structures for maintaining set partitions
inferred← citeshttps://doi.org/10.1006/jagm.1996.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1565openalex-snapshot
Scalable Parallel Algorithms for Geometric Pattern Recognition
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-44634-6_12openalex-snapshot
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
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/3-540-56287-7_96openalex-snapshot
Implicit point location in arrangements of line segments, with an application to motion planning
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_234openalex-snapshot
Connected component and simple polygon intersection searching
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_64openalex-snapshot
Reporting red-blue intersections between two sets of connected line segments
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-540-24587-2_28openalex-snapshot
On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
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/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1007/bf01940884openalex-snapshot
Connected component and simple polygon intersection searching
inferred← citeshttps://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
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/bf02189329openalex-snapshot
Constructing arrangements optimally in parallel
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/bf02712875openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1007/s00453-005-1202-xopenalex-snapshot
Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
inferred← citeshttps://doi.org/10.1007/s41060-021-00301-0openalex-snapshot
Sampling and sparsification for approximating the packedness of trajectories and detecting gatherings
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90021-4openalex-snapshot
Good splitters for counting points in triangles
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00020-8openalex-snapshot
The exact fitting problem in higher dimensions
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/j.comgeo.2005.02.003openalex-snapshot
Counting and representing intersections among triangles in three dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101920openalex-snapshot
Approximating the packedness of polygonal curves
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101945openalex-snapshot
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102196openalex-snapshot
Algorithms for computing closest points for segments
inferred← citeshttps://doi.org/10.1016/j.jda.2008.08.001openalex-snapshot
Planar bichromatic minimum spanning trees
inferred← citeshttps://doi.org/10.1016/s0010-4485(02)00099-4openalex-snapshot
Reducing feasible contacts between polyhedral models to red–blue intersections on the sphere
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00295-xopenalex-snapshot
Approximation algorithms for projective clustering
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00049-4openalex-snapshot
Reporting intersecting pairs of convex polytopes in two and three dimensions
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00003-xopenalex-snapshot
Triangulating with high connectivity
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00055-3openalex-snapshot
Queries with segments in Voronoi diagrams
inferred← citeshttps://doi.org/10.1109/12.376174openalex-snapshot
On computing connected components of line segments
inferred← citeshttps://doi.org/10.1109/cvpr52729.2023.00369openalex-snapshot
SplineCam: Exact Visualization and Characterization of Deep Network Geometry and Decision Boundaries
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00072openalex-snapshot
2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions
inferred← citeshttps://doi.org/10.1109/robot.1999.770379openalex-snapshot
Benefits of applicability constraints in decomposition-free interference detection between nonconvex polyhedral models
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/1.9781611977066.7openalex-snapshot
A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines
inferred← citeshttps://doi.org/10.1137/1.9781611977073.10openalex-snapshot
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees
inferred← citeshttps://doi.org/10.1137/1.9781611977073.123openalex-snapshot
Constructing Many Faces in Arrangements of Lines and Segments
inferred← citeshttps://doi.org/10.1137/19m1257548openalex-snapshot
Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications
inferred← citeshttps://doi.org/10.1137/s0097539703433900openalex-snapshot
Pseudo-Line Arrangements: Duality, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1137/s009753979426616xopenalex-snapshot
Computing Many Faces in Arrangements of Lines and Segments
inferred← citeshttps://doi.org/10.1142/s0218195909003088openalex-snapshot
EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA
inferred← citeshttps://doi.org/10.1142/s0218195911003779openalex-snapshot
FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS
inferred← citeshttps://doi.org/10.1142/s0218195912500100openalex-snapshot
REPORTING BICHROMATIC SEGMENT INTERSECTIONS FROM POINT SETS
inferred← citeshttps://doi.org/10.1145/1016028.1016030openalex-snapshot
Managing uncertainty in moving objects databases
inferred← citeshttps://doi.org/10.1145/109648.109650openalex-snapshot
Counting circular arc intersections
inferred← citeshttps://doi.org/10.1145/1498698.1626535openalex-snapshot
Reduction rules deliver efficient FPT-algorithms for covering points with lines
inferred← citeshttps://doi.org/10.1145/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
inferred← citeshttps://doi.org/10.1145/177424.177548openalex-snapshot
Computing many faces in arrangements of lines and segments
inferred← citeshttps://doi.org/10.1145/220279.220293openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1145/225058.225285openalex-snapshot
Computing faces in segment and simplex arrangements
inferred← citeshttps://doi.org/10.1145/3591357openalex-snapshot
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision 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.1145/73833.73868openalex-snapshot
Ray shooting and other applications of spanning trees with low stabbing number
inferred← citeshttps://doi.org/10.1145/997817.997825openalex-snapshot
Computing the visibility graph of points within a polygon
inferred← citeshttps://doi.org/10.1177/02783640122067499openalex-snapshot
An Orientation-Based Pruning Tool to Speed Up Contact Determination between Translating Polyhedral Models
inferred← citeshttps://doi.org/10.1201/9781420035315-44openalex-snapshot
The discrepancy method in computational geometry
inferred← citeshttps://doi.org/10.1201/9781420035315.ch44openalex-snapshot
The discrepancy method in computational geometry
inferred← citeshttps://doi.org/10.22028/d291-25744openalex-snapshot
Interaktive Montageplanung mit Kollisionserkennung
inferred← citeshttps://doi.org/10.25904/1912/1694openalex-snapshot
The NP-Hardness of Covering Points with Lines, Paths and Tours and their Tractability with FPT-Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2009.05541openalex-snapshot
2D Fractional Cascading on Axis-aligned Planar Subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.2012.04403openalex-snapshot
Computing The Packedness of Curves
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.