Computing Point/Curve and Curve/Curve Bisectors
Proceedings of the 5th IMA Conference on the Mathematics of Surfaces
(n, m)-Cubes and Farey Nets for Naive Planes Understanding
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Recognition of Digital Naive Planes and Polyhedrization
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Digital Image Processing Using MATLAB
Digital Image Processing Using MATLAB
An elementary algorithm for digital arc segmentation
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Discrete bisector function and Euclidean skeleton in 2D and 3D
Image and Vision Computing
A generalized preimage for the digital analytical hyperplane recognition
Discrete Applied Mathematics
On three constrained versions of the digital circular arc recognition problem
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
3D discrete rotations using hinge angles
Theoretical Computer Science
Properties and applications of the simplified generalized perpendicular bisector
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Determining Digital Circularity Using Integer Intervals
Journal of Mathematical Imaging and Vision
Fast Circular Arc Segmentation Based on Approximate Circularity and Cuboid Graph
Journal of Mathematical Imaging and Vision
Hi-index | 0.00 |
This paper presents a theoretical generalization of the circumcenter as the intersection of generalized perpendicular bisectors. We define generalized bisectors between two regions as an area where each point is the center of at least one circle crossing each of the two regions. These new notions should allow the design of new circle recognition algorithms.