scientific article
From MaRDI portal
Publication:3358269
zbMath0732.68104MaRDI QIDQ3358269
Publication date: 1991
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programminghyperplanesflatsline segmentsconvex hull constructiondigitization schemespolytope intersection detection
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Digital planarity -- a review ⋮ About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces ⋮ Covering a Euclidean line or hyperplane by dilations of its discretization ⋮ An optimal parallel algorithm for digital curve segmentation ⋮ The supercover of an \(m\)-flat is a discrete analytical object ⋮ “Honeycomb” vs Square and Cubic Models ⋮ A generalized preimage for the digital analytical hyperplane recognition ⋮ Digital straightness -- a review
