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

BINAY K. BHATTACHARYA; ASISH MUKHOPADHYAY; GODFRIED T. TOUSSAINT

doi:10.1142/s0218195999000078

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

International Journal of Computational Geometry & Applications ◽

10.1142/s0218195999000078 ◽

1999 ◽

Vol 09 (01) ◽

pp. 81-96 ◽

Cited By ~ 1

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.

Get full-text (via PubEx)

A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028280 ◽

2005 ◽

pp. 412-424 ◽

Cited By ~ 3

Author(s):

Binary K. Bhattacharya ◽

Asish Mukhopadhyay ◽

Godfried T. Toussaint

Keyword(s):

Line Segment ◽

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm

Get full-text (via PubEx)

Optimal linear-time algorithm for the shortest illuminating line segment in a polygon

Proceedings of the tenth annual symposium on Computational geometry - SCG '94 ◽

10.1145/177424.177984 ◽

1994 ◽

Cited By ~ 6

Author(s):

Gautam Das ◽

Giri Narasimhan

Keyword(s):

Line Segment ◽

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm ◽

Optimal Linear

Get full-text (via PubEx)

A linear time algorithm for finding all farthest neighbors in a convex polygon

Information Processing Letters ◽

10.1016/0020-0190(89)90103-8 ◽

1989 ◽

Vol 31 (1) ◽

pp. 17-20 ◽

Cited By ~ 11

Author(s):

Alok Aggarwal ◽

Dina Kravets

Keyword(s):

Convex Polygon ◽

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm

Get full-text (via PubEx)

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

Computer Vision Graphics and Image Processing ◽

10.1016/0734-189x(86)90070-8 ◽

1986 ◽

Vol 34 (1) ◽

pp. 123 ◽

Cited By ~ 1

Author(s):

Subhash Suri

Keyword(s):

Linear Time ◽

Simple Polygon ◽

Time Algorithm ◽

Linear Time Algorithm

Get full-text (via PubEx)

Correction to "A linear-time algorithm for triangulating a simple polygon"

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) ◽

10.1109/sfcs.1987.16 ◽

1987 ◽

Author(s):

Robert E. Tarjan ◽

Christopher I. van Wyk

Keyword(s):

Linear Time ◽

Simple Polygon ◽

Time Algorithm ◽

Linear Time Algorithm

Get full-text (via PubEx)

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

Discrete & Computational Geometry ◽

10.1007/s00454-016-9796-0 ◽

2016 ◽

Vol 56 (4) ◽

pp. 836-859 ◽

Cited By ~ 6

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

Get full-text (via PubEx)

A linear time algorithm for minimum conic link path in a simple polygon

Expert Systems with Applications ◽

10.1016/j.eswa.2015.09.034 ◽

2016 ◽

Vol 45 ◽

pp. 286-293

Author(s):

Shuo-Yan Chou ◽

Chang-Chien Chou

Keyword(s):

Linear Time ◽

Simple Polygon ◽

Time Algorithm ◽

Linear Time Algorithm

Get full-text (via PubEx)

A Linear time algorithm for computing the Voronoi diagram of a convex polygon

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28400 ◽

1987 ◽

Cited By ~ 26

Author(s):

A. Aggarwal ◽

L. Guibas ◽

J. Saxe ◽

P. Shor

Keyword(s):

Voronoi Diagram ◽

Convex Polygon ◽

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm

Get full-text (via PubEx)

A linear time algorithm to remove winding of a simple polygon

Computational Geometry ◽

10.1016/j.comgeo.2005.05.001 ◽

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

Get full-text (via PubEx)

A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES

International Journal of Computational Geometry & Applications ◽

10.1142/s0218195992000123 ◽

1992 ◽

Vol 02 (02) ◽

pp. 191-214 ◽

Cited By ~ 12

Author(s):

SHARAT CHANDRAN ◽

DAVID M. MOUNT

Keyword(s):

Parallel Algorithms ◽

Parallel Algorithm ◽

Convex Polygon ◽

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm ◽

New Techniques ◽

Crcw Pram

We consider the problems of computing the largest area triangle enclosed within a given n-sided convex polygon and the smallest area triangle which encloses a given convex polygon. We show that these problems are closely related by presenting a single sequential linear time algorithm which essentially solves both problems simultaneously. We also present a cost-optimal parallel algorithm that solves both of these problems in O( log log n) time using n/ log log n processors on a CRCW PRAM. In order to achieve these bounds we develop new techniques for the design of parallel algorithms for computational problems involving the rotating calipers method.

Get full-text (via PubEx)