On the public citation graph
Onk-sets in arrangements of curves and surfaces
0 signed · 89 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/3-540-19488-6_118openalex-snapshot
Arrangements of curves in the plane — topology, combinatorics, and algorithms
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01758853openalex-snapshot
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
inferredcites →https://doi.org/10.1007/bf01840441openalex-snapshot
Fractional cascading: II. Applications
inferredcites →https://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
inferredcites →https://doi.org/10.1007/bf02187685openalex-snapshot
Halfspace range search: An algorithmic application ofk-sets
inferredcites →https://doi.org/10.1007/bf02187732openalex-snapshot
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
inferredcites →https://doi.org/10.1007/bf02187733openalex-snapshot
The upper envelope of piecewise linear functions: Algorithms and applications
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187745openalex-snapshot
On arrangements of Jordan arcs with three intersections per pair
inferredcites →https://doi.org/10.1007/bf02187777openalex-snapshot
Upper bounds on geometric permutations for convex sets
inferredcites →https://doi.org/10.1007/bf02187778openalex-snapshot
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
inferredcites →https://doi.org/10.1007/bf02187867openalex-snapshot
Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1016/0012-365x(85)90111-6openalex-snapshot
Geometric permutations for convex sets
inferredcites →https://doi.org/10.1016/0097-3165(84)90081-5openalex-snapshot
On the number of k-subsets of a set of n points in the plane
inferredcites →https://doi.org/10.1016/0097-3165(86)90122-6openalex-snapshot
The number of small semispaces of a finite set of points in the plane
inferredcites →https://doi.org/10.1016/0097-3165(89)90032-0openalex-snapshot
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1016/0898-1221(85)90105-1openalex-snapshot
Some dynamic computational geometry problems
inferredcites →https://doi.org/10.1016/s0747-7171(08)80070-3openalex-snapshot
On the two-dimensional davenport-schinzel problem
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.1989.63458openalex-snapshot
An upper bound on the number of planar k-sets
inferredcites →https://doi.org/10.1137/0216006openalex-snapshot
Power Diagrams: Properties, Algorithms and Applications
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73833.73868openalex-snapshot
Ray shooting and other applications of spanning trees with low stabbing number
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.1998.0957openalex-snapshot
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
inferred← citeshttps://doi.org/10.1007/11589440_1openalex-snapshot
Matching Points with Circles and Squares
inferred← citeshttps://doi.org/10.1007/11970125_5openalex-snapshot
Covering Many or Few Points with Unit Disks
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-46691-6_1openalex-snapshot
Recent Developments in the Theory of Arrangements of Surfaces
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_259openalex-snapshot
Computing the smallest k-enclosing circle and related problems
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_17openalex-snapshot
On intersection searching problems involving curved objects
inferred← citeshttps://doi.org/10.1007/978-1-4614-7258-2_34openalex-snapshot
A Remark on Transversal Numbers
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_2openalex-snapshot
Point Enclosure Problem for Homothetic Polygons
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-540-68566-1_5openalex-snapshot
Clusters in Aggregated Health Data
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_13openalex-snapshot
Coloring Geometric Range Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_6openalex-snapshot
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_28openalex-snapshot
Detecting Areas Visited Regularly
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_28openalex-snapshot
A Remark on Transversal Numbers
inferred← citeshttps://doi.org/10.1007/bf01955043openalex-snapshot
Lines in Space: Combinatorics and Algorithms
inferred← citeshttps://doi.org/10.1007/bf02570714openalex-snapshot
Almost tight upper bounds for the single cell and zone problems in three dimensions
inferred← citeshttps://doi.org/10.1007/bf02573989openalex-snapshot
Arrangements of oriented hyperplanes
inferred← citeshttps://doi.org/10.1007/bf02574383openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
inferred← citeshttps://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1007/bf02716576openalex-snapshot
The overlay of lower envelopes and its applications
inferred← citeshttps://doi.org/10.1007/s00224-008-9135-9openalex-snapshot
Covering Many or Few Points with Unit Disks
inferred← citeshttps://doi.org/10.1007/s00453-009-9281-8openalex-snapshot
Algorithmic Aspects of Proportional Symbol Maps
inferred← citeshttps://doi.org/10.1007/s00454-008-9116-4openalex-snapshot
Coloring Geometric Range Spaces
inferred← citeshttps://doi.org/10.1007/s00493-023-00012-zopenalex-snapshot
Sunflowers in Set Systems of Bounded Dimension
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90003-5openalex-snapshot
Computing the smallest k-enclosing circle and related problems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
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.2015.11.001openalex-snapshot
Kinetic k-Semi-Yao graph and its applications
inferred← citeshttps://doi.org/10.1016/j.jda.2017.04.003openalex-snapshot
On the arrangement of stochastic lines in R2
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)00016-8openalex-snapshot
On fat partitioning, fat covering and the union size of polygons
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00027-2openalex-snapshot
3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
inferred← citeshttps://doi.org/10.1017/s0963548315000280openalex-snapshot
Decomposition of Multiple Packings with Subquadratic Union Complexity
inferred← citeshttps://doi.org/10.1109/robot.1992.220116openalex-snapshot
Motion planning for spider robots
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185347openalex-snapshot
Fat triangles determine linearly many holes (computational geometry)
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366835openalex-snapshot
The union of convex polyhedra in three dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366837openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366849openalex-snapshot
Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646104openalex-snapshot
Improved bounds on planar k-sets and k-levels
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892109openalex-snapshot
On levels in arrangements of curves
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181981openalex-snapshot
Low-dimensional linear programming with violations
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238227openalex-snapshot
On levels in arrangements of curves. II. A simple inequality and its consequences
inferred← citeshttps://doi.org/10.1137/060669474openalex-snapshot
On Approximating the Depth and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539703439404openalex-snapshot
Low-Dimensional Linear Programming with Violations
inferred← citeshttps://doi.org/10.1137/s009753979018330xopenalex-snapshot
Fat Triangles Determine Linearly Many Holes
inferred← citeshttps://doi.org/10.1137/s0097539793250755openalex-snapshot
The Union of Convex Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539795281840openalex-snapshot
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1137/s0097539795295936openalex-snapshot
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1137/s0097539797326289openalex-snapshot
Motion Planning of Legged Robots
inferred← citeshttps://doi.org/10.1142/s0218195909003076openalex-snapshot
SMALLEST COLOR-SPANNING OBJECT REVISITED
inferred← citeshttps://doi.org/10.1142/s0218195909003118openalex-snapshot
MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION
inferred← citeshttps://doi.org/10.1142/s0218195911003652openalex-snapshot
DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
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/1824777.1824782openalex-snapshot
On the bichromatic k -set problem
inferred← citeshttps://doi.org/10.1145/336154.336173openalex-snapshot
An improved bound for k -sets in three dimensions
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.