Constructing Approximate Voronoi Diagrams from Digital Images of Generalized Polygons and Circular Objects
نویسندگان
چکیده
In this paper we present the geometrical construction of an approximate generalized Voronoi diagram for generalized polygons and circular objects based on their minimum geometrical structure that are extracted from the object's digital image. The construction is done in ) (n Ο time complexity, where n is the number of single points defining the set of objects. An application of this technique has been done for mobile robot path planning.
منابع مشابه
A Subdivision Approach to Weighted Voronoi Diagrams
Voronoi diagrams are a central topic in Computational Geometry. They can be generalized in many ways. Suppose S is a finite set of geometric objects and there is a notion of Voronoi diagram V or(S) that we want to compute. One approach to designing algorithms for V or(S) is to (1) assume some general properties of S, and (2) describe an abstract algorithm based on the Real RAM model that has so...
متن کاملComputing generalized higher-order Voronoi diagrams on triangulated surfaces
We present an algorithm for computing exact shortest paths, and consequently distance functions, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex triangulated polyhedral surface. The algorithm is generalized to the case when a set of generalized sites is considered, providing their distance field that implicitly represents the Voronoi diag...
متن کاملMapping is a Diffusion Problem
A variety of operations have been described in recent years that are intended as digital solutions to a basic class of cartographic adjacency problems. A selection of these algorithms includes: interpolation; Voronoi diagrams of point distributions (proximal maps, Thiessen polygons); skeleton encoding (of scanned characters or polygons); corridor selection, or extraction of regions within speci...
متن کاملGeneralized Voronoi Diagrams on Polyhedral Terrains
We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a polyhedral terrain in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) ...
متن کاملConstructing Area Voronoi Diagram Based on Direct Calculation of the Freeman Code of Expanded Contours
A Voronoi diagram of image elements provides an intuitive and appealing definition of proximity, which has been suggested as an effective tool for the description of relations among the neighboring objects in a digital image. In this paper, an implementation algorithm based on direct calculation of the Freeman code of expanded contours is proposed for generating area Voronoi diagram of connecte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003