1995•Information Processing LettersRequires access

An optimal algorithm for finding the edge visibility polygon under limited visibility

Sung‐Ho Kim, Jung-Heum Park, Seung-Hak Choi, Sung Yong Shin, Kyung‐Yong Chwa

Open publisher page 6 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Visibility, Visibility polygon, Polygon (computer graphics), Visibility graph, Simple polygon, Star-shaped polygon, Enhanced Data Rates for GSM Evolution, Rectilinear polygon

Back to paper search Browse research topics Original source

An optimal algorithm for finding the edge visibility polygon under limited visibility — Research Paper | ScholarLens