9 April 1993 Elimination theory for systems of linear inequalities applied to problems in digital geometry
Author Affiliations +
Proceedings Volume 1832, Vision Geometry; (1993) https://doi.org/10.1117/12.142183
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
In digital geometry we study the properties of discrete representations of geometrical sets; in general, a discrete representation consists of a set of digital points on a rectangular grid. In this paper we consider discrete representations that can be specified by linear inequalities. For example, a digital straight line, and more generally, a digital hyperplane can be specified by an expression that involves two inequalities. First, we describe an elimination method to solve systems of inequalities; it is based on a theorem on convex sets due to Helly. Next, we discuss how this method can be used to derive properties of digital sets. Finally, we illustrate this approach for digital curves. In particular, we show how the chord property for digital straight lines can be extended to digital curves of arbitrary order.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Peter Veelaert, Peter Veelaert, } "Elimination theory for systems of linear inequalities applied to problems in digital geometry", Proc. SPIE 1832, Vision Geometry, (9 April 1993); doi: 10.1117/12.142183; https://doi.org/10.1117/12.142183


Algorithm For Singular Value Decomposition
Proceedings of SPIE (November 27 1984)
Computing stair-case visibility polygon
Proceedings of SPIE (November 30 1993)
Fast generalized Lloyd iteration for VQ codebook design
Proceedings of SPIE (March 02 1995)
Fast hybrid block/region-based algorithm for object tracking
Proceedings of SPIE (January 16 1997)
Three-dimensional thinning algorithm using subfields
Proceedings of SPIE (January 03 1995)

Back to Top