A theoretical structure for computational geometry: regions of point-free overlapping circles

Authors:
Thomas Iwaszko;Mahmoud Melkemi;Lhassane Idoumghar
Affiliations:
Université de Haute Alsace, LMIA, Equipe MAGE, Mulhouse, France;Université de Haute Alsace, LMIA, Equipe MAGE, Mulhouse, France;Université de Haute Alsace, LMIA, Equipe MAGE, Mulhouse, France
Venue:
ISCGAV'09 Proceedings of the 9th WSEAS international conference on Signal processing, computational geometry and artificial vision
Year:
2009

Citing 7
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Placing the largest similar copy of a convex polygon among polygonal obstacles

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Two-Dimensional Voronoi Diagrams in the Lp-Metric

Journal of the ACM (JACM)
Voronoi diagrams based on convex distance functions

SCG '85 Proceedings of the first annual symposium on Computational geometry
Polygon Placement Under Translation and Rotation

STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Integrating mathematica with C++ for the development of a computational geometry problem solver

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let S be a set of two or more points in the plane. Given an arbitrary configuration of one or more overlapping circles (referred to as shape-models), how to know the locations where the shape-model would not contain any point of S if translated ? A new theoretical structure, which can be seen as a generalized Voronoi diagram, is presented as an answer to this problem.