On the public citation graph
Counting triangle crossings and halving planes
0 signed · 69 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/bf01464231openalex-snapshot
Mengen konvexer K�rper, die einen gemeinsamen Punkt enthalten
inferredcites →https://doi.org/10.1007/bf02574700openalex-snapshot
Points and triangles in the plane and halving planes in space
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/0097-3165(93)90082-jopenalex-snapshot
Improved bounds for intersecting triangles and halving planes
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.1016/s0304-0208(08)73484-4openalex-snapshot
Crossing-Free Subgraphs
inferredcites →https://doi.org/10.1017/s0963548300000225openalex-snapshot
Point Selections and Weak ε-Nets for Convex Hulls
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/eujc.2001.0452openalex-snapshot
Cutting a Bunch of Grapes by a Plane
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_25openalex-snapshot
Partitioning Colored Point Sets into Monochromatic Parts
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_31openalex-snapshot
Minors, Embeddability, and Extremal Problems for Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-1-4615-5319-9_2openalex-snapshot
Median problems in location science
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_2openalex-snapshot
Representing Graphs and Hypergraphs by Touching Polygons in 3D
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_129openalex-snapshot
Extremal Hypergraphs and Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_9openalex-snapshot
On Codimension One Embedding of Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferred← citeshttps://doi.org/10.1007/bf02570713openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1007/bfb0009486openalex-snapshot
Extremal problems for geometric hypergraphs
inferred← citeshttps://doi.org/10.1007/pl00009305openalex-snapshot
A Helly-Type Theorem for Unions of Convex Sets
inferred← citeshttps://doi.org/10.1007/pl00009348openalex-snapshot
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%
inferred← citeshttps://doi.org/10.1007/pl00009354openalex-snapshot
Improved Bounds for Planar k -Sets and Related Problems
inferred← citeshttps://doi.org/10.1007/pl00009396openalex-snapshot
Geometric Lower Bounds for Parametric Matroid Optimization
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-008-9124-4openalex-snapshot
Stabbing Simplices by Points and Flats
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-017-9936-1openalex-snapshot
On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space
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.disc.2021.112354openalex-snapshot
On the complexity of the k -level in arrangements of pseudoplanes
inferred← citeshttps://doi.org/10.1016/j.jcta.2008.07.003openalex-snapshot
Eppstein's bound on intersecting triangles revisited
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00126-1openalex-snapshot
Median and center hyperplanes in Minkowski spaces—a unified approach
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.1016/s0166-218x(98)00103-6openalex-snapshot
Median hyperplanes in normed spaces — a survey
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00007-2openalex-snapshot
On the number of simplicial complexes in Rd
inferred← citeshttps://doi.org/10.1017/s0963548302005527openalex-snapshot
The Clarkson–Shor Technique Revisited and Extended
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.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/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/s0097539795281840openalex-snapshot
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
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.1142/s0218195902000943openalex-snapshot
PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
inferred← citeshttps://doi.org/10.1145/177424.177521openalex-snapshot
Constructing levels in arrangements and higher order Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/177424.177648openalex-snapshot
Cutting dense point sets in half
inferred← citeshttps://doi.org/10.1145/177424.178039openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1145/1824777.1824782openalex-snapshot
On the bichromatic k -set problem
inferred← citeshttps://doi.org/10.1145/225058.225284openalex-snapshot
Geometric lower bounds for parametric matroid optimization
inferred← citeshttps://doi.org/10.1145/262839.262856openalex-snapshot
On levels in arrangements of lines, segments, planes, and triangles
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/378583.378680openalex-snapshot
The Clarkson-Shor technique revisited and extended
inferred← citeshttps://doi.org/10.3929/ethz-a-007143531openalex-snapshot
Depth, crossings and conflicts in discrete geometry
inferred← citeshttps://doi.org/10.3929/ethz-a-010060286openalex-snapshot
On expansion and spectral properties of simplicial complexes
inferred← citeshttps://doi.org/10.4230/lipics.socg.2019.62openalex-snapshot
On the Complexity of the k-Level in Arrangements of Pseudoplanes
inferred← citeshttps://doi.org/10.48550/arxiv.1812.08447openalex-snapshot
On the Complexity of Embeddable Simplicial Complexes
inferred← citeshttps://doi.org/10.5555/1070432.1070466openalex-snapshot
On levels in arrangements of surfaces 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.