.png){kind=icon}
Return
Discrete combinatorial geometry
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(97)00001-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In computer vision, one of the ultimate aims is the determination of geometric properties of 3-dimensional objects in our real world from measured data. As an expression intermediate between measured raw data and geometric properties, we need a method of representing objects in computers. For the object representations, geometry which uses only finite-precision numbers is necessary because in computers we can only manipulate finite-precision numbers. In this paper, we develop a new geometry, which we call discrete combinatorial geometry due to the discreteness of the space of finite-precision numbers, applying fundamental definitions of classical combinatorial geometry. Using discrete combinatorial geometry, we introduce a new method for representing curves, surfaces and objects in computers. We also show that our new representation is based on the fact that the boundary of a surface consists of curves and the boundary of an object consists of surfaces. (C) 1997 Pattern Recognition Society. Published by Elsevier Science Ltd.
Keywords:
combinatorial geometry
simplex
complex
curve
surface
object
boundary
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
.png){kind=icon}
