On the public citation graph
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%
0 signed · 90 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-63890-3_16openalex-snapshot
A characterization of planar graphs by pseudo-line arrangements
inferredcites →https://doi.org/10.1007/978-3-642-58043-7_6openalex-snapshot
Allowable Sequences and Order Types in Discrete and Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
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/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02187829openalex-snapshot
An upper bound on the number of planarK-sets
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.1007/bf02574035openalex-snapshot
On minimum and maximum spanning trees of linearly moving points
inferredcites →https://doi.org/10.1007/bf02574381openalex-snapshot
Counting triangle crossings and halving planes
inferredcites →https://doi.org/10.1007/bf02574700openalex-snapshot
Points and triangles in the plane and halving planes in space
inferredcites →https://doi.org/10.1007/pl00009348openalex-snapshot
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%
inferredcites →https://doi.org/10.1016/0020-0190(91)90076-topenalex-snapshot
On disjoint concave chains in arrangements of (pseudo) lines
inferredcites →https://doi.org/10.1016/0020-0190(94)00057-3openalex-snapshot
On disjoint concave chains in arrangements of (pseudo) lines
inferredcites →https://doi.org/10.1016/0097-3165(92)90028-sopenalex-snapshot
The colored Tverberg's problem and complexes of injective functions
inferredcites →https://doi.org/10.1016/0925-7721(92)90006-eopenalex-snapshot
Reporting points in halfspaces
inferredcites →https://doi.org/10.1016/b978-0-7204-2262-7.50018-1openalex-snapshot
Dissection Graphs of Planar Point Sets
inferredcites →https://doi.org/10.1145/160985.161148openalex-snapshot
Counting triangle crossings and halving planes
inferredcites →https://doi.org/10.1145/220279.220304openalex-snapshot
How to cut pseudo-parabolas into segments
inferredcites →https://doi.org/10.1145/225058.225284openalex-snapshot
Geometric lower bounds for parametric matroid optimization
inferredcites →https://doi.org/10.1145/262839.262856openalex-snapshot
On levels in arrangements of lines, segments, planes, and triangles
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1201/9781420010749-38openalex-snapshot
Sensitivity Analysis in Combinatorial Optimization
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/jcss.2000.1709openalex-snapshot
Efficient Searching with Linear Constraints
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-30551-4_9openalex-snapshot
Polyline Fitting of Planar Points Under Min-sum Criteria
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_12openalex-snapshot
Extremal Configurations and Levels in Pseudoline Arrangements
inferred← citeshttps://doi.org/10.1007/pl00009354openalex-snapshot
Improved Bounds for Planar k -Sets and Related Problems
inferred← citeshttps://doi.org/10.1007/s00454-001-0005-3openalex-snapshot
An Improved Bound for k-Sets in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-001-0022-2openalex-snapshot
Recognition of Flat Orbifolds and the Classification of Tilings in R 3
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-010-9248-1openalex-snapshot
Relative (p,ε)-Approximations in Geometry
inferred← citeshttps://doi.org/10.1007/s00454-012-9417-5openalex-snapshot
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
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.1007/s00454-016-9784-4openalex-snapshot
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
inferred← citeshttps://doi.org/10.1007/s00454-016-9811-5openalex-snapshot
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes
inferred← citeshttps://doi.org/10.1007/s00454-022-00469-7openalex-snapshot
Improved Bounds for the Expected Number of k-Sets
inferred← citeshttps://doi.org/10.1007/s10115-018-1290-yopenalex-snapshot
Cost optimization based on influence and user preference
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.dam.2012.03.009openalex-snapshot
Minimizing the error of linear separators on linearly inseparable data
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112354openalex-snapshot
On the complexity of the k -level in arrangements of pseudoplanes
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.1016/j.jda.2017.04.003openalex-snapshot
On the arrangement of stochastic lines in R2
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.031openalex-snapshot
Minimum width color spanning annulus
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115583openalex-snapshot
On k -enclosing slab problems
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00430-2openalex-snapshot
On halving line arrangements
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00253-5openalex-snapshot
The k-centrum multi-facility location problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00217-7openalex-snapshot
Crossing-free segments and triangles in point configurations
inferred← citeshttps://doi.org/10.1017/s0963548310000143openalex-snapshot
An Improved Bound for k-Sets in Four Dimensions
inferred← citeshttps://doi.org/10.1109/icde.2016.7498283openalex-snapshot
Influence based cost optimization on user preference
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743509openalex-snapshot
Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensions
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.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.1137/1.9781611974331.ch83openalex-snapshot
Approximating the k-Level in Three-Dimensional Plane Arrangements
inferred← citeshttps://doi.org/10.1137/s0097539703439404openalex-snapshot
Low-Dimensional Linear Programming with Violations
inferred← citeshttps://doi.org/10.1137/s0097539798349188openalex-snapshot
Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
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.1142/s0218195906001951openalex-snapshot
POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
inferred← citeshttps://doi.org/10.1142/s0218195997000314openalex-snapshot
Computational Geometry Column 32
inferred← citeshttps://doi.org/10.1145/1377676.1377691openalex-snapshot
On levels in arrangements of curves, iii
inferred← citeshttps://doi.org/10.1145/1542362.1542420openalex-snapshot
Approximation algorithms for maximum independent set of pseudo-disks
inferred← citeshttps://doi.org/10.1145/1824777.1824782openalex-snapshot
On the bichromatic k -set problem
inferred← citeshttps://doi.org/10.1145/262301.262303openalex-snapshot
Computational geometry column 32
inferred← citeshttps://doi.org/10.1145/275487.275506openalex-snapshot
Efficient searching with linear constraints
inferred← citeshttps://doi.org/10.1145/276884.276906openalex-snapshot
Results on k-sets and j-facets via continuous motion
inferred← citeshttps://doi.org/10.1145/336154.336173openalex-snapshot
An improved bound for k -sets in three dimensions
inferred← citeshttps://doi.org/10.1145/3514221.3526182openalex-snapshot
T-LevelIndex: Towards Efficient Query Processing in Continuous Preference Space
inferred← citeshttps://doi.org/10.1145/378583.378675openalex-snapshot
Notes on computing peaks in k-levels and parametric spanning trees
inferred← citeshttps://doi.org/10.14288/1.0052098openalex-snapshot
Guarantees concerning geometric objects with imprecise points
inferred← citeshttps://doi.org/10.14778/3339490.3339500openalex-snapshot
Creating top ranking options in the continuous option and preference space
inferred← citeshttps://doi.org/10.26754/uz.978-84-92774-11-1openalex-snapshot
XIII Encuentros de Geometría Computacional. Zaragoza, 29 de junio al 1 de julio de 2009
inferred← citeshttps://doi.org/10.48550/arxiv.1103.1431openalex-snapshot
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
inferred← citeshttps://doi.org/10.48550/arxiv.1609.07709openalex-snapshot
Depth contours in arrangements of halfplanes
inferred← citeshttps://doi.org/10.5555/1070432.1070466openalex-snapshot
On levels in arrangements of surfaces in three dimensions
inferred← citeshttps://doi.org/10.82308/1812openalex-snapshot
Guarding problems and geometric split trees
showing the first 63 of 64 · page through all 64
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.