Optimal Mesh Computer Algorithms for Simple Polygons
نویسنده
چکیده
We present optimal parallel algorithms that run in O(p n) time on a p n p n mesh-connected computer for a number of fundamental problems concerning visibility and distance properties inside a simple polygon. These include computing shortest paths, shortest path trees, shortest path partitions, all-farthest neighbors (both internal and external), the visibility polygon of a point, the weak visibility polygon of an edge, and the shooting problem.
منابع مشابه
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O p n time on a p n pn mesh connected computer for a number of fundamental problems concerning proximity and vis ibility in a simple polygon These include computing shortest paths shortest path trees shortest path partitions all farthest neighbors the visibility polygon of a point the weak visibility polygon of an edge and the ray shooting problem
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملHoneycomb Networks: Topological Properties and Communication Algorithms
The honeycomb mesh, based on hexagonal plane tessellation, is considered as a multiprocessor interconnection network. A honeycomb mesh network with n nodes has degree 3 and diameter a 1.63 n 1, which is 25 percent smaller degree and 18.5 percent smaller diameter than the mesh-connected computer with approximately the same number of nodes. Vertex and edge symmetric honeycomb torus network is obt...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملOptimal Triangulation and Mesh
This report surveys the area of triangulating simple polygons and point sets in R 2 and R 3. Important algorithms and variations of various problems are discussed .
متن کامل