On the public citation graph
Cutting dense point sets in half
0 signed · 65 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/bf02123006openalex-snapshot
Geometric methods in the study of irregularities of distribution
inferredcites →https://doi.org/10.1007/bf02187685openalex-snapshot
Halfspace range search: An algorithmic application ofk-sets
inferredcites →https://doi.org/10.1007/bf02187725openalex-snapshot
The maximum size of a convex polygon in a restricted set of points in the plane
inferredcites →https://doi.org/10.1007/bf02187829openalex-snapshot
An upper bound on the number of planarK-sets
inferredcites →https://doi.org/10.1007/bf02187831openalex-snapshot
Convex independent sets and 7-holes in restricted planar point sets
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.1016/0012-365x(86)90004-xopenalex-snapshot
On the intersection of edges of a geometric graph by straight lines
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(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.1017/cbo9780511617331openalex-snapshot
Integral Geometry and Geometric Probability
inferredcites →https://doi.org/10.1090/s0894-0347-1990-1046181-2openalex-snapshot
The intrinsic spread of a configuration in 𝑅^{𝑑}
inferredcites →https://doi.org/10.1137/0215019openalex-snapshot
Constructing Belts in Two-Dimensional Arrangements with Applications
inferredcites →https://doi.org/10.1145/73007.73046openalex-snapshot
Coordinate representation of order types requires exponential storage
inferredcites →https://doi.org/10.1145/7529.8927openalex-snapshot
Stochastic sampling in computer graphics
inferredcites →https://doi.org/10.2307/1990931openalex-snapshot
The Intrinsic Spread of a Configuration in R d
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11821069_30openalex-snapshot
k-Sets of Convex Inclusion Chains of Planar Point Sets
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_1openalex-snapshot
Optimization over k-set Polytopes and Efficient k-set Enumeration
inferred← citeshttps://doi.org/10.1007/978-981-16-1740-9_21openalex-snapshot
Rederiving the Upper Bound for Halving Edges Using Cardano’s Formula
inferred← citeshttps://doi.org/10.1007/pl00009354openalex-snapshot
Improved Bounds for Planar k -Sets and Related Problems
inferred← citeshttps://doi.org/10.1007/s00023-022-01264-zopenalex-snapshot
An Effective Solution to Convex 1-Body N-Representability
inferred← citeshttps://doi.org/10.1007/s00453-003-1043-4openalex-snapshot
Combinatorial and Experimental Methods for Approximate Point Pattern Matching
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-2778-4openalex-snapshot
In between k -Sets, j -Facets, and i -Faces: (i ,j) - Partitions
inferred← citeshttps://doi.org/10.1007/s00454-003-2927-4openalex-snapshot
Nice Point Sets Can Have Nasty Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-004-1089-3openalex-snapshot
Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?
inferred← citeshttps://doi.org/10.1007/s00454-019-00080-3openalex-snapshot
Dense Point Sets with Many Halving Lines
inferred← citeshttps://doi.org/10.1007/s00454-020-00190-3openalex-snapshot
Separation by Convex Pseudo-Circles
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/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.cam.2021.113812openalex-snapshot
Polynomial-reproducing spline spaces from fine zonotopal tilings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.01.008openalex-snapshot
Flip distance to some plane configurations
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.03.002openalex-snapshot
Bivariate B-splines from convex configurations
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.01.003openalex-snapshot
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.022openalex-snapshot
Faster balanced clusterings in high dimension
inferred← citeshttps://doi.org/10.1016/s0196-8858(02)00014-3openalex-snapshot
On the number of corner cuts
inferred← citeshttps://doi.org/10.1109/isvd.2006.43openalex-snapshot
k-set polytopes and order-k Delaunay diagrams
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646104openalex-snapshot
Improved bounds on planar k-sets and k-levels
inferred← citeshttps://doi.org/10.1137/s1052623497344002openalex-snapshot
A Polynomial Time Algorithm for Shaped Partition Problems
inferred← citeshttps://doi.org/10.1142/9781860948534_0004openalex-snapshot
Finding the convex hull of a dense set
inferred← citeshttps://doi.org/10.1142/s0218195911003846openalex-snapshot
CENTROID TRIANGULATIONS FROM k-SETS
inferred← citeshttps://doi.org/10.1145/1869790.1869834openalex-snapshot
Dynamic one-sided boundary labeling
inferred← citeshttps://doi.org/10.1145/2462356.2462367openalex-snapshot
Lower bounds for k-distance approximation
inferred← citeshttps://doi.org/10.1145/2582112.2582148openalex-snapshot
Separation by Convex Pseudo-Circles
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.1556/012.2022.01516openalex-snapshot
Convexity of Distinct Sum Sets
inferred← citeshttps://doi.org/10.32604/cmes.2022.020831openalex-snapshot
A Comparison of Shale Gas Fracturing Based on Deep and Shallow Shale Reservoirs in the United States and China
inferred← citeshttps://doi.org/10.48550/arxiv.1905.00791openalex-snapshot
Flip Distance to some Plane Configurations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110030openalex-snapshot
Dense point sets have sparse Delaunay triangulations
inferred← citeshttps://doi.org/10.5555/545381.545397openalex-snapshot
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
inferred← citeshttps://doi.org/10.70675/73b5a17az7fe1z4094z9f15z5b3a9af1d592openalex-snapshot
Unstructured Isogeometric Analysis with Applications to Seismic Wave Propagation
inferred← citeshttps://doi.org/10.70675/75f898dfzfaacz4592za6e3z8ee996f080b5openalex-snapshot
K-set Polygons and Centroid Triangulations
inferred← citeshttps://doi.org/10.70675/a351859az0723z49a4zab6az34bdcb3accc9openalex-snapshot
Geometric realizations using regular subdivisions : construction of many polytopes, sweep polytopes, s-permutahedra
inferred← citeshttps://doi.org/10.7551/mitpress/4908.003.0005openalex-snapshot
Nearest-Neighbor Searching and Metric Space 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.