On the public citation graph

Lines, line-point incidences and crossing families in dense sets

https://doi.org/10.1007/bf01844852
0 signed · 26 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4614-7258-2_36openalex-snapshot
On Mutually Avoiding Sets
inferredcites →https://doi.org/10.1007/bf01215345openalex-snapshot
Crossing families
inferredcites →https://doi.org/10.1007/bf02123006openalex-snapshot
Geometric methods in the study of irregularities of distribution
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/bf02187831openalex-snapshot
Convex independent sets and 7-holes in restricted planar point sets
inferredcites →https://doi.org/10.1007/bf02579184openalex-snapshot
On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
inferredcites →https://doi.org/10.1007/bf02579194openalex-snapshot
Extremal problems in discrete geometry
inferredcites →https://doi.org/10.1090/dimacs/006/19openalex-snapshot
Notes on geometric graph theory
inferredcites →https://doi.org/10.1112/jlms/s2-44.2.351openalex-snapshot
Volume Ratios and a Reverse Isoperimetric Inequality
inferredcites →https://doi.org/10.1145/177424.177648openalex-snapshot
Cutting dense point sets in half

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-3-642-36763-2_33openalex-snapshot
The Visible Perimeter of an Arrangement of Disks
inferred← citeshttps://doi.org/10.1007/s00373-025-03006-4openalex-snapshot
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
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-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.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.aim.2021.107779openalex-snapshot
Planar point sets determine many pairwise crossing segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.006openalex-snapshot
The visible perimeter of an arrangement of disks
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.comgeo.2022.101899openalex-snapshot
On crossing-families in planar point sets
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.09.003openalex-snapshot
Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space
inferred← citeshttps://doi.org/10.1145/202840.606474openalex-snapshot
Reprints from Computing Reviews
inferred← citeshttps://doi.org/10.4230/lipics.gd.2024.9openalex-snapshot
On problems related to crossing families
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"
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.