On the public citation graph

A recursive sweep-plane algorithm, determining all cells of a finite division of Rd

https://doi.org/10.1007/bf02241747
0 signed · 35 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/bf02992825openalex-snapshot
Erweiterter Polyedersatz und Euler-Shephardsche Additionstheoreme
inferredcites →https://doi.org/10.1007/bf03323348openalex-snapshot
Zur Eulerschen Charakteristik allgemeiner, insbesondere konvexer Polyeder
inferredcites →https://doi.org/10.1080/0025570x.1978.11976715openalex-snapshot
Simple Partitions of Space
inferredcites →https://doi.org/10.1080/0025570x.1978.11976718openalex-snapshot
Platonic Divisions of Space
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1109/sfcs.1976.16openalex-snapshot
Geometric intersection problems
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1112/s0025579300005581openalex-snapshot
On the Euler characteristic of spherical polyhedra and the Euler relation
inferredcites →https://doi.org/10.1145/358656.358681openalex-snapshot
Plane-sweep algorithms for intersecting geometric figures
inferredcites →https://doi.org/10.1515/crll.1955.194.101openalex-snapshot
Eulers Charakteristik und kombinatorische Geometrie.
inferredcites →https://doi.org/10.5169/seals-26035openalex-snapshot
Eine Schnittrekursion für die Eulersche Charakteristik euklidischer Polyeder mit Anwendungen innerhalb der kombinatorischen Geometrie
inferredcites →https://doi.org/10.5951/mt.59.8.0722openalex-snapshot
A Mathematician's Progress

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/cviu.1999.0791openalex-snapshot
The Euler Characteristics of Discrete Objects and Discrete Quasi-Objects
inferred← citeshttps://doi.org/10.1007/3-540-50335-8_28openalex-snapshot
Elementary set operations with d-dimensional polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-642-70284-6_3openalex-snapshot
Applying Relational Database Techniques to Solid Modeling
inferred← citeshttps://doi.org/10.1007/978-3-642-71388-0_35openalex-snapshot
Wechselwirkung Zwischen der Computergrafik und der Theorie der Polyeder
inferred← citeshttps://doi.org/10.1007/bf00271644openalex-snapshot
Space sweep solves intersection of convex polyhedra
inferred← citeshttps://doi.org/10.1007/bf02251831openalex-snapshot
A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form
inferred← citeshttps://doi.org/10.1007/bfb0024838openalex-snapshot
The Euler characteristic of discrete object
inferred← citeshttps://doi.org/10.1007/s12532-024-00266-8openalex-snapshot
On the B-differential of the componentwise minimum of two affine vector functions
inferred← citeshttps://doi.org/10.1016/0010-4485(86)90094-1openalex-snapshot
Applying relational database techniques to solid modelling
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90002-9openalex-snapshot
Arrangements of planes in space
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90186-3openalex-snapshot
Arrangements of planes in space
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00380-2openalex-snapshot
Shadow-boundaries of convex bodies
inferred← citeshttps://doi.org/10.1016/0024-3795(83)80008-1openalex-snapshot
A sweep-plane algorithm for computing the volume of polyhedra represented in boolean form
inferred← citeshttps://doi.org/10.1016/j.patrec.2020.04.015openalex-snapshot
Decomposition and construction of higher-dimensional neighbourhood operations
inferred← citeshttps://doi.org/10.1016/s0734-189x(84)80019-5openalex-snapshot
Algorithms for the euler characteristic and related additive functionals of digital objects
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80162-9openalex-snapshot
Computing a sweeping-plane in regular (“general”) position: a numerical and a symbolic solution
inferred← citeshttps://doi.org/10.1090/s0025-5718-98-01004-7openalex-snapshot
A sweep-plane algorithm for generating random tuples in simple polytopes
inferred← citeshttps://doi.org/10.1109/12.67328openalex-snapshot
Minimum spanning trees of moving points in the plane
inferred← citeshttps://doi.org/10.1109/pacrim.1993.407230openalex-snapshot
Disjunctive constraint satisfaction over reals
inferred← citeshttps://doi.org/10.1109/sfcs.1983.11openalex-snapshot
Constructing arrangements of lines and hyperplanes with applications
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferred← citeshttps://doi.org/10.5802/acirm.67openalex-snapshot
Curvature and Flow in Digital Space
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.