Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case

DOI10.1007/978-3-319-09955-2_1zbMath1419.68194OpenAlexW132600680MaRDI QIDQ3190060

Laurent Vuillon, Xavier Provençal, Eric Domenjoud

Publication date: 15 September 2014

Published in: Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09955-2_1

zbMATH Keywords

connectednessconnecting thicknessdiscrete hyperplanefully subtractive algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

An output-sensitive algorithm to compute the normal vector of a digital plane ⋮ Palindromic language of thin discrete planes ⋮ Combinatorial generation of planar sets ⋮ Approximation of digital surfaces by a hierarchical set of planar patches ⋮ Facet Connectedness of Arithmetic Discrete Hyperplanes with Non-Zero Shift

This page was built for publication: Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case