Finding an approximate minimum-link visibility path inside a simple polygon
type: Item
instance of: scholarly article
title: Finding an approximate minimum-link visibility path inside a simple polygon
zbMATH Open document ID: 1022.68624
DOI: 10.1016/0020-0190(95)00072-K
author: Juan-Miguel Gracia
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 984968
zbMATH Keywords: computational geometry
zbMATH Keywords: approximation algorithms
zbMATH Keywords: simple polygon
zbMATH Keywords: visibility path
zbMATH Keywords: minimum link path
MaRDI profile type: Publication
cites work: Minimal link visibility paths inside a simple polygon
cites work: Computing the visibility polygon from a convex set and related problems
cites work: Computing minimum length paths of a given homotopy class
cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles
cites work: Minimum Cuts for Circular-Arc Graphs
cites work: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
cites work: A linear time algorithm for minimum link paths inside a simple polygon
full work available at URL: 0020-0190(95)00072-k
OpenAlex ID: W1997350911
description: scientific article; zbMATH DE number 984968