A linear time algorithm for minimum link paths inside a simple polygon

1986 ◽  
Vol 34 (1) ◽  
pp. 123 ◽  
Author(s):  
Subhash Suri
Keyword(s):  
Linear Time ◽  
Simple Polygon ◽  
Time Algorithm ◽  
Linear Time Algorithm

scholarly journals A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon

2016 ◽  
Vol 56 (4) ◽  
pp. 836-859 ◽  
Author(s):  
Hee-Kap Ahn ◽  
Luis Barba ◽  
Prosenjit Bose ◽  
Jean-Lou De Carufel ◽  
Matias Korman ◽  
...  
Keyword(s):  
Linear Time ◽  
Simple Polygon ◽  
Time Algorithm ◽  
Linear Time Algorithm

scholarly journals A linear time algorithm to remove winding of a simple polygon

2006 ◽  
Vol 33 (3) ◽  
pp. 165-173
Author(s):  
Binay Kumar Bhattacharya ◽  
Subir Kumar Ghosh ◽  
Thomas Caton Shermer
Keyword(s):  
Linear Time ◽  
Simple Polygon ◽  
Time Algorithm ◽  
Linear Time Algorithm

COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON

1999 ◽  
Vol 09 (01) ◽  
pp. 81-96 ◽  
Author(s):  
BINAY K. BHATTACHARYA ◽  
ASISH MUKHOPADHYAY ◽  
GODFRIED T. TOUSSAINT
Keyword(s):  
Line Segment ◽  
Convex Polygon ◽  
Linear Time ◽  
Simple Polygon ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Suitable Generalization

A simple polygon P is said to be weakly extrenally visible from a line segment L if it lies outside P and for every point p on the boundary of P there is a point q on L such that no point in the interior of [Formula: see text] lies inside P. In this paper, a linear time algorithm is proposed for computing a shortest line segment from which P is weakly externally visible. This is done by a suitable generalization of a linear time algorithm which solves the same problem for a convex polygon.

MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON

1995 ◽  
Vol 05 (01n02) ◽  
pp. 53-74 ◽  
Author(s):  
ROLF KLEIN ◽  
ANDRZEJ LINGAS
Keyword(s):  
Voronoi Diagram ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Linear Time ◽  
Simple Polygon ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Manhattan Metric ◽  
Optimal Linear ◽  
Planar Polygon

Let P be a simple planar polygon. We present a linear time algorithm for constructing the bounded Voronoi diagram of P in the Manhattan metric, where each point z in P belongs to the region of the closest vertex of P that is visible from z. Among other consequences, the minimum spanning tree of the vertices in the Manhattan metric that is contained in P can be computed within optimal linear time. The same results hold for the L∞-metric.α

Sign in / Sign up

Export Citation Format

Share Document