OpenAlex | Finding the Shortest Watchman Route in a Simple Polygon

Finding the Shortest Watchman Route in a Simple Polygon

Work

Year: 1999

Type: article

Source: Discrete & Computational Geometry

Authors Svante Carlsson, Håkan Jönsson, Bengt J. Nilsson

Institutions Luleå University of Technology, Lund University

Cites: 17

Cited by: 79

Related to: 10

FWCI: 2.102

Citation percentile (by year/subfield): 97.24

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze