Approximation of Point Sets by 1-Corner Polygonal Chains

Authors:
José-Miguel Dí"az-Báñez;Francisco Gómez;Ferran Hurtado
Affiliations:
-;-;-
Venue:
INFORMS Journal on Computing
Year:
2000

Citing 0
Cited 7

A new algorithm for fitting a rectilinear x-monotone curve to a set of points in the plane

Pattern Recognition Letters
Computing obnoxious 1-corner polygonal chains

Computers and Operations Research
Approximating a set of points by a step function

Journal of Visual Communication and Image Representation
Computing obnoxious 1-corner polygonal chains

Computers and Operations Research
Rectilinear approximation of a set of points in the plane

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Computing shortest heterochromatic monotone routes

Operations Research Letters
Computing an obnoxious anchored segment

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider some problems that belong to the interplay between the field of Facility Location and the area of Computational Geometry. Specifically, given a setS of points in the plane, we discuss several variations of the problem of finding monotone 1-corner polygonal chains that minimize the maximum vertical distance toS.