Discrete analytical hyperplanes
Graphical Models and Image Processing
The Visual Hull Concept for Silhouette-Based Image Understanding
IEEE Transactions on Pattern Analysis and Machine Intelligence
Concurrency of Line Segments in Uncertain Geometry
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Efficient adaptive density estimation per image pixel for the task of background subtraction
Pattern Recognition Letters
Minimal arithmetic thickness connecting discrete planes
Discrete Applied Mathematics
On digital plane preimage structure
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Robust foreground extraction technique using Gaussian family model and multiple thresholds
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part I
Visual Hull from Imprecise Polyhedral Scene
3DIMPVT '11 Proceedings of the 2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission
Reconstruction of concurrent lines from leaning points
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Three-Dimensional Digital Planes
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
In this paper we examine concurrency relations between planes whose position is not precisely known. The simplest case consists of four planes, where we have to determine whether the four planes can be forced to pass through one common intersection point by moving them slightly within specified limits. We prove that if such a concurrency relation is possible then it can be found in a finite number of steps by a simple geometrical construction. This result remains valid for larger collections of planes, with multiple concurrency relations, provided each pair of relations shares at most one plane, and the relations do not form cycles.