Efficient algorithms for 3D scan-conversion of parametric curves, surfaces, and volumes
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Discrete analytical hyperplanes
Graphical Models and Image Processing
Connectivity in Digital Pictures
Journal of the ACM (JACM)
Arcs and Curves in Digital Pictures
Journal of the ACM (JACM)
The Discrete Analytical Hyperspheres
IEEE Transactions on Visualization and Computer Graphics
3D Line Voxelization and Connectivity Control
IEEE Computer Graphics and Applications
Segmentation and Length Estimation of 3D Discrete Curves
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Discrete linear objects in dimension n: the standard model
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Voronoi diagrams of semi-algebraic sets
Voronoi diagrams of semi-algebraic sets
Continuous Shading of Curved Surfaces
IEEE Transactions on Computers
Algorithm for computer control of a digital plotter
IBM Systems Journal
Linear segmentation of discrete curves into blurred segments
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Three-Dimensional Digital Line Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
The offset to an algebraic curve and an application to conics
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Characterization of the closest discrete approximation of a line in the 3-dimensional space
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
| Hi-index | 0.00 |
In this paper we investigate an approach for constructing a connected digitization of an object S@?R^n by taking the integer points within an offset of S of a certain radius. We consider the cases when S is a curve, surface, and an arbitrary path-connected object. We determine the minimal value of the offset radius which guarantees connectivity of the digitization. We also derive conditions under which the offset digitization of a disconnected object is always connected.