Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
An approach to discretization based on the Hausdorff metric
ISMM '98 Proceedings of the fourth international symposium on Mathematical morphology and its applications to image and signal processing
Discretization in Hausdorff Space
Journal of Mathematical Imaging and Vision
Topological properties of Hausdorff discretization, and comparison to other discretization schemes
Theoretical Computer Science
Hausdorff Sampling of Closed Sets into a Boundedly Compact Space
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Hausdorff Discretization and Its Comparison to Other Discretization Schemes
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
SpaMod: Design of a Spatial Modeling Tool
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Discretization in 2D and 3D Orders
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Analytical description of digital circles
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 0.00 |
This paper is a continuation of our works in which we study the properties of a new framework for discretization of closed sets based on Hausdorff metric. Let F be a nonempty closed subset of Rn; S ⊆ Zn is a Hausdorff discretization of F if it minimizes the Hausdorff distance to F. We study the properties of Hausdorff discretizations of algebraic sets. Actually we give some decidable and undecidable properties concerning Hausdorff discretizations of algebraic sets and we prove that some Hausdorff discretizations of algebraic sets are diophantine sets. We refine the last results for algebraic curves and more precisely for straight lines.