On the public citation graph
How to Cut Pseudoparabolas into Segments
0 signed · 62 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-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/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/bf02187779openalex-snapshot
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
inferredcites →https://doi.org/10.1007/bf02574679openalex-snapshot
Lower bounds on the length of monotone paths in arrangements
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/0097-3165(86)90078-6openalex-snapshot
On the maximal number of edges of many faces in an arrangement
inferredcites →https://doi.org/10.1016/0898-1221(85)90105-1openalex-snapshot
Some dynamic computational geometry problems
inferredcites →https://doi.org/10.1017/s1446788700005954openalex-snapshot
An extremal problem in graph theory
inferredcites →https://doi.org/10.1109/sfcs.1992.267750openalex-snapshot
On minimum and maximum spanning trees of linearly moving points
inferredcites →https://doi.org/10.1145/177424.178039openalex-snapshot
On geometric optimization with few violated constraints
inferredcites →https://doi.org/10.1145/225058.225284openalex-snapshot
Geometric lower bounds for parametric matroid optimization
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.4064/cm-13-2-251-254openalex-snapshot
On an extremal problem in graph theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-29929-7_8openalex-snapshot
Incidence and Arrangement Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_35openalex-snapshot
Intersection Reverse Sequences and Geometric Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_3openalex-snapshot
Arrangements in Geometry: Recent Advances and Challenges
inferred← citeshttps://doi.org/10.1007/pl00009396openalex-snapshot
Geometric Lower Bounds for Parametric Matroid Optimization
inferred← citeshttps://doi.org/10.1007/s00454-001-0026-yopenalex-snapshot
Online Point Location in Planar Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1007/s00454-001-0043-xopenalex-snapshot
On the Complexity of Arrangements of Circles in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-001-0084-1openalex-snapshot
Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces
inferred← citeshttps://doi.org/10.1007/s00454-001-0086-zopenalex-snapshot
K-Levels of Concave Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-002-2840-2openalex-snapshot
On Levels in Arrangements of Curves
inferred← citeshttps://doi.org/10.1007/s00454-005-1165-3openalex-snapshot
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
inferred← citeshttps://doi.org/10.1007/s00454-012-9428-2openalex-snapshot
On Levels in Arrangements of Surfaces in Three Dimensions
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.aim.2018.03.015openalex-snapshot
A Crossing Lemma for Jordan curves
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.10.002openalex-snapshot
Tangencies between families of disjoint regions in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.09.009openalex-snapshot
Localized geometric query problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.10.004openalex-snapshot
On the number of touching pairs in a set of planar curves
inferred← citeshttps://doi.org/10.1016/j.jcta.2005.07.002openalex-snapshot
Intersection reverse sequences and geometric applications
inferred← citeshttps://doi.org/10.1016/j.jcta.2017.02.006openalex-snapshot
Cutting algebraic curves into pseudo-segments and applications
inferred← citeshttps://doi.org/10.1017/s0963548316000043openalex-snapshot
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892109openalex-snapshot
On levels in arrangements of curves
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959882openalex-snapshot
On the complexity of many faces in arrangements of circles
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.1109/sffcs.1999.814582openalex-snapshot
Taking a walk in a planar arrangement
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814610openalex-snapshot
Lovasz's lemma for the three-dimensional K-level of concave surfaces and its applications
inferred← citeshttps://doi.org/10.1112/jlms.70324openalex-snapshot
Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications
inferred← citeshttps://doi.org/10.1137/21m1409305openalex-snapshot
Counting and Cutting Rich Lenses in Arrangements of Circles
inferred← citeshttps://doi.org/10.1137/s0097539703433900openalex-snapshot
Pseudo-Line Arrangements: Duality, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1137/s0097539799362627openalex-snapshot
Taking a Walk in a Planar Arrangement
inferred← citeshttps://doi.org/10.1142/s0218195902000967openalex-snapshot
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
inferred← citeshttps://doi.org/10.1145/1377676.1377691openalex-snapshot
On levels in arrangements of curves, iii
inferred← citeshttps://doi.org/10.1145/1810959.1811029openalex-snapshot
Tangencies between families of disjoint regions in the plane
inferred← citeshttps://doi.org/10.1145/1824777.1824782openalex-snapshot
On the bichromatic k -set problem
inferred← citeshttps://doi.org/10.1145/276884.276899openalex-snapshot
Cutting cylces of rods in space
inferred← citeshttps://doi.org/10.1145/513400.513416openalex-snapshot
Incidences between points and circles in three and higher dimensions
inferred← citeshttps://doi.org/10.1145/513400.513417openalex-snapshot
Lenses in arrangements of pseudo-circles and their applications
inferred← citeshttps://doi.org/10.1145/777792.777807openalex-snapshot
Topological graphs with no self-intersecting cycle of length 4
inferred← citeshttps://doi.org/10.1145/972639.972641openalex-snapshot
Lenses in arrangements of pseudo-circles and their applications
inferred← citeshttps://doi.org/10.1145/997817.997874openalex-snapshot
On locally Delaunay geometric graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0558openalex-snapshot
Querying for the Largest Empty Geometric Object in a Desired Location
inferred← citeshttps://doi.org/10.48550/arxiv.1111.2918openalex-snapshot
Localized Geometric Query Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1911.07287openalex-snapshot
A Crossing Lemma for Families of Jordan Curves with a Bounded Intersection Number
inferred← citeshttps://doi.org/10.5555/1070432.1070466openalex-snapshot
On levels in arrangements of surfaces in three dimensions
inferred← citeshttps://doi.org/10.5555/365411.365419openalex-snapshot
Online point location in planar arrangements and its applications
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.