On the public citation graph
Points and triangles in the plane and halving planes in space
0 signed · 77 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/bf00181519openalex-snapshot
The number of triangles covering the center of an n-set
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187829openalex-snapshot
An upper bound on the number of planarK-sets
inferredcites →https://doi.org/10.1016/0012-365x(82)90115-7openalex-snapshot
A generalization of carathéodory's theorem
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(85)90017-2openalex-snapshot
On the number of line separations of a finite set 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/b978-0-7204-2262-7.50018-1openalex-snapshot
Dissection Graphs of Planar Point Sets
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/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/98524.98551openalex-snapshot
Slimming down by adding; selecting heavily covered points
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.1007/978-1-4615-5319-9_2openalex-snapshot
Median problems in location science
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_115openalex-snapshot
No Selection Lemma for Empty Triangles
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_21openalex-snapshot
Hitting and Piercing Rectangles Induced by a Point Set
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_12openalex-snapshot
Recent Developments in Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_6openalex-snapshot
Allowable Sequences and Order Types in Discrete and Computational Geometry
inferred← citeshttps://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferred← citeshttps://doi.org/10.1007/bf02187829openalex-snapshot
An upper bound on the number of planarK-sets
inferred← citeshttps://doi.org/10.1007/bf02570713openalex-snapshot
On geometric optimization with few violated constraints
inferred← citeshttps://doi.org/10.1007/bf02574025openalex-snapshot
Improved bounds on weak ε-nets for convex sets
inferred← citeshttps://doi.org/10.1007/bf02574381openalex-snapshot
Counting triangle crossings and halving planes
inferred← citeshttps://doi.org/10.1007/bfb0009486openalex-snapshot
Extremal problems for geometric hypergraphs
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/pl00009365openalex-snapshot
Extremal Problems for Geometric Hypergraphs
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-002-2840-2openalex-snapshot
On Levels in Arrangements of Curves
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/s10474-024-01431-0openalex-snapshot
No selection lemma for empty triangles
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50017-1openalex-snapshot
Helly, Radon, and Carathéodory Type Theorems
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50025-0openalex-snapshot
Geometric Algorithms
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.dam.2021.07.038openalex-snapshot
Upper bounds for stabbing simplices by a line
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.028openalex-snapshot
Berge's theorem, fractional Helly, and art galleries
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/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.1017/s0963548300000225openalex-snapshot
Point Selections and Weak ε-Nets for Convex Hulls
inferred← citeshttps://doi.org/10.1017/s0963548303005984openalex-snapshot
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles
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.1112/jlms/s2-45.2.314openalex-snapshot
A Colored Version of Tverberg's Theorem
inferred← citeshttps://doi.org/10.1137/s0097539790179919openalex-snapshot
Selecting Heavily Covered Points
inferred← citeshttps://doi.org/10.1142/s0218195916500047openalex-snapshot
Selection Lemmas for Various Geometric Objects
inferred← citeshttps://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferred← citeshttps://doi.org/10.1145/160985.161141openalex-snapshot
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
inferred← citeshttps://doi.org/10.1145/160985.161148openalex-snapshot
Counting triangle crossings and halving planes
inferred← citeshttps://doi.org/10.1145/167088.167222openalex-snapshot
Improved bounds on weak ε-nets for convex sets
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.1515/crelle.2011.157openalex-snapshot
Overlap properties of geometric expanders
inferred← citeshttps://doi.org/10.48550/arxiv.1005.1392openalex-snapshot
Overlap properties of geometric expanders
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0443openalex-snapshot
Selection Lemmas for various geometric objects
inferred← citeshttps://doi.org/10.48550/arxiv.1512.07505openalex-snapshot
A short proof of the first selection lemma and weak $\frac{1}{r}$-nets for moving points
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.