On the public citation graph

On arrangements of Jordan arcs with three intersections per pair

https://doi.org/10.1007/bf02187745
0 signed · 28 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-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/bf02579209openalex-snapshot
Almost linear upper bounds on the length of general davenport—schinzel sequences
inferredcites →https://doi.org/10.1016/0898-1221(85)90105-1openalex-snapshot
Some dynamic computational geometry problems
inferredcites →https://doi.org/10.1145/73393.73423openalex-snapshot
On the general motion planning problem with two degrees of freedom
inferredcites →https://doi.org/10.2307/2309947openalex-snapshot
Introduction to Riemann Surfaces.
inferredcites →https://doi.org/10.2307/2313470openalex-snapshot
Algebraic Topology: An Introduction.

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-47738-1_28openalex-snapshot
On the complexity of the union of geometric objects
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_270openalex-snapshot
On fat partitioning, fat covering and the union size of polygons
inferred← citeshttps://doi.org/10.1007/bf02574706openalex-snapshot
Onk-sets in arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.1007/s00453-011-9517-2openalex-snapshot
Near-Linear Approximation Algorithms for Geometric Hitting Sets
inferred← citeshttps://doi.org/10.1007/s00454-006-1273-8openalex-snapshot
Improved Approximation Algorithms for Geometric Set Cover
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
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.2020.101650openalex-snapshot
Improved approximation bounds for the minimum constraint removal problem
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00016-8openalex-snapshot
On fat partitioning, fat covering and the union size of polygons
inferred← citeshttps://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185347openalex-snapshot
Fat triangles determine linearly many holes (computational geometry)
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892130openalex-snapshot
On the boundary complexity of the union of fat triangles
inferred← citeshttps://doi.org/10.1137/090762968openalex-snapshot
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
inferred← citeshttps://doi.org/10.1137/s0097539700382169openalex-snapshot
On the Boundary Complexity of the Union of Fat Triangles
inferred← citeshttps://doi.org/10.1137/s009753979018330xopenalex-snapshot
Fat Triangles Determine Linearly Many Holes
inferred← citeshttps://doi.org/10.1145/1064092.1064115openalex-snapshot
Improved approximation algorithms for geometric set cover
inferred← citeshttps://doi.org/10.1145/1536414.1536501openalex-snapshot
Small-size ε-nets for axis-parallel rectangles and boxes
inferred← citeshttps://doi.org/10.1145/1542362.1542368openalex-snapshot
Near-linear approximation algorithms for geometric hitting sets
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.