On the public citation graph
More onk-sets of finite sets in the plane
0 signed · 55 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.1016/0097-3165(80)90011-4openalex-snapshot
On the combinatorial classification of nondegenerate configurations in the plane
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)90075-0openalex-snapshot
The number of extreme pairs of finite point-sets in Euclidean spaces
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.1137/0215019openalex-snapshot
Constructing Belts in Two-Dimensional Arrangements with Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-50335-8_22openalex-snapshot
On separable and rectangular clusterings
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_2openalex-snapshot
The Rectilinear Crossing Number of K n : Closing in (or Are We?)
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_4openalex-snapshot
Improved Bounds for the Number of (≤ k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K n
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/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferred← citeshttps://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferred← citeshttps://doi.org/10.1007/bf02187829openalex-snapshot
An upper bound on the number of planarK-sets
inferred← citeshttps://doi.org/10.1007/bf02574692openalex-snapshot
On levels in arrangements and voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bfb0019430openalex-snapshot
Orders, k-sets and fast halfplane search on paged memory
inferred← citeshttps://doi.org/10.1007/pl00009318openalex-snapshot
On the Number of Arrangements of Pseudolines
inferred← citeshttps://doi.org/10.1007/pl00009345openalex-snapshot
How to Cut Pseudoparabolas into Segments
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-005-1165-3openalex-snapshot
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
inferred← citeshttps://doi.org/10.1007/s00454-005-1227-6openalex-snapshot
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
inferred← citeshttps://doi.org/10.1007/s00454-010-9248-1openalex-snapshot
Relative (p,ε)-Approximations in Geometry
inferred← citeshttps://doi.org/10.1007/s00454-012-9403-yopenalex-snapshot
On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n
inferred← citeshttps://doi.org/10.1007/s00493-023-00062-3openalex-snapshot
Sweeps, Polytopes, Oriented Matroids, and Allowable Graphs of Permutations
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90213-xopenalex-snapshot
Line arrangements and range search
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90068-8openalex-snapshot
The complexity of point configurations
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90013-8openalex-snapshot
On separable clusterings
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00019-0openalex-snapshot
Algorithms for generalized halfspace range searching and other intersection searching problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00012-7openalex-snapshot
Algorithms for generalized halfspace range searching and other intersection searching problems
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.2005.01.001openalex-snapshot
On some monotone path problems in line arrangements
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80134-2openalex-snapshot
Picture Processing: 1986
inferred← citeshttps://doi.org/10.1017/9781009701259.026openalex-snapshot
Extremal Problems Related to the Sylvester—Gallai Theorem
inferred← citeshttps://doi.org/10.1080/01621459.1990.10475313openalex-snapshot
Computing Least Median of Squares Regression Lines and Guided Topological Sweep
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63458openalex-snapshot
An upper bound on the number of planar k-sets
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.2003.1238227openalex-snapshot
On levels in arrangements of curves. II. A simple inequality and its consequences
inferred← citeshttps://doi.org/10.1137/0220013openalex-snapshot
Approximate Levels in Line Arrangements
inferred← citeshttps://doi.org/10.1142/s0218195902000967openalex-snapshot
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
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/220279.220304openalex-snapshot
How to cut pseudo-parabolas into segments
inferred← citeshttps://doi.org/10.1145/237218.237232openalex-snapshot
On the number of arrangements of pseudolines
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/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferred← citeshttps://doi.org/10.1145/73833.73835openalex-snapshot
A deterministic algorithm for partitioning arrangements of lines and its application
inferred← citeshttps://doi.org/10.70675/a351859az0723z49a4zab6az34bdcb3accc9openalex-snapshot
Geometric realizations using regular subdivisions : construction of many polytopes, sweep polytopes, s-permutahedra
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.