On the public citation graph
On the Complexity of the Union of Fat Convex Objects in the Plane
0 signed · 56 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.1006/jagm.1996.0063openalex-snapshot
Range Searching and Point Location among Fat Objects
inferredcites →https://doi.org/10.1007/3-540-57155-8_270openalex-snapshot
On fat partitioning, fat covering and the union size of polygons
inferredcites →https://doi.org/10.1007/3-540-60313-1_148openalex-snapshot
Linear size binary space partitions for fat objects
inferredcites →https://doi.org/10.1007/3-540-63307-3_69openalex-snapshot
Dynamic data structures for fat objects and their applications
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferredcites →https://doi.org/10.1007/bf01182771openalex-snapshot
Algorithms for bichromatic line-segment problems and polyhedral terrains
inferredcites →https://doi.org/10.1007/bf01758853openalex-snapshot
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
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/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/pl00009424openalex-snapshot
On the Boundary of the Union of Planar Convex Sets
inferredcites →https://doi.org/10.1016/0020-0190(92)90211-dopenalex-snapshot
Point location in fat subdivisions
inferredcites →https://doi.org/10.1016/0925-7721(93)90007-sopenalex-snapshot
The complexity of the free space for a robot moving amidst fat obstacles
inferredcites →https://doi.org/10.1016/0925-7721(93)90018-2openalex-snapshot
On the union of fat wedges and separating a collection of segments by a line
inferredcites →https://doi.org/10.1016/0925-7721(94)90003-5openalex-snapshot
Computing the smallest k-enclosing circle and related problems
inferredcites →https://doi.org/10.1016/s0925-7721(96)00016-8openalex-snapshot
On fat partitioning, fat covering and the union size of polygons
inferredcites →https://doi.org/10.1016/s0925-7721(96)00027-2openalex-snapshot
3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
inferredcites →https://doi.org/10.1109/sfcs.1996.548507openalex-snapshot
Binary space partitions for fat rectangles
inferredcites →https://doi.org/10.1137/s009753979018330xopenalex-snapshot
Fat Triangles Determine Linearly Many Holes
inferredcites →https://doi.org/10.1145/262839.262911openalex-snapshot
On the complexity of the union of fat objects in the plane
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
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/978-3-540-30140-0_41openalex-snapshot
Approximate Unions of Lines and Minkowski Sums
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_64openalex-snapshot
Domination in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_27openalex-snapshot
Placing Text Boxes on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_11openalex-snapshot
Conflict-Free Coloring Made Stronger
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_13openalex-snapshot
PTAS for Weighted Set Cover on Unit Squares
inferred← citeshttps://doi.org/10.1007/978-3-642-41498-5_12openalex-snapshot
Conflict-Free Coloring and its Applications
inferred← citeshttps://doi.org/10.1007/s00453-005-1191-9openalex-snapshot
Approximate unions of lines and minkowski sums
inferred← citeshttps://doi.org/10.1007/s00454-001-0001-7openalex-snapshot
On the number of regular vertices of the union of jordan regions
inferred← citeshttps://doi.org/10.1007/s00454-005-1162-6openalex-snapshot
Conflict-Free Coloring of Points and Simple Regions in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-005-1166-2openalex-snapshot
Lines Avoiding Unit Balls in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-006-1263-xopenalex-snapshot
On the Union of κ-Round Objects in Three and Four Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-010-9312-xopenalex-snapshot
On the Union of Cylinders in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-016-9820-4openalex-snapshot
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s004540010064openalex-snapshot
Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions
inferred← citeshttps://doi.org/10.1017/9781009701259.030openalex-snapshot
Binary Space Partitions: Recent Developments
inferred← citeshttps://doi.org/10.1017/s0963548315000280openalex-snapshot
Decomposition of Multiple Packings with Subquadratic Union Complexity
inferred← citeshttps://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferred← citeshttps://doi.org/10.1101/2021.02.24.21252390openalex-snapshot
Graphical Models of Pandemic
inferred← citeshttps://doi.org/10.1109/focs.2007.10openalex-snapshot
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
inferred← citeshttps://doi.org/10.1109/focs.2007.9openalex-snapshot
Extractors and Rank Extractors for Polynomial Sources
inferred← citeshttps://doi.org/10.1109/focs.2008.25openalex-snapshot
On the Union of Cylinders in Three Dimensions
inferred← citeshttps://doi.org/10.1137/090762968openalex-snapshot
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
inferred← citeshttps://doi.org/10.1137/090765092openalex-snapshot
Semialgebraic Range Reporting and Emptiness Searching with Applications
inferred← citeshttps://doi.org/10.1137/120891241openalex-snapshot
Improved Bounds for the Union of Locally Fat Objects in the Plane
inferred← citeshttps://doi.org/10.1137/s0097539702407515openalex-snapshot
The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
inferred← citeshttps://doi.org/10.1142/s0218195901000651openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 42
inferred← citeshttps://doi.org/10.1145/1536414.1536501openalex-snapshot
Small-size ε-nets for axis-parallel rectangles and boxes
inferred← citeshttps://doi.org/10.1145/1613676.1613678openalex-snapshot
On the union of fat tetrahedra in three dimensions
inferred← citeshttps://doi.org/10.1145/378583.378598openalex-snapshot
The union of congruent cubes in three dimensions
inferred← citeshttps://doi.org/10.1145/777792.777810openalex-snapshot
On conflict-free coloring of points and simple regions in the plane
inferred← citeshttps://doi.org/10.1145/997817.997826openalex-snapshot
On lines avoiding unit balls in three dimensions
inferred← citeshttps://doi.org/10.1145/997817.997875openalex-snapshot
On the union of κ-round objects
inferred← citeshttps://doi.org/10.3929/ethz-a-007143531openalex-snapshot
Depth, crossings and conflicts in discrete geometry
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.