Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms

Authors:
David Avis;Bryan Beresford-Smith;Luc Devroye;Hossam Elgindy;Eric Guévremont;Ferran Hurtado;Binhai Zhu
Affiliations:
-;-;-;-;-;-;-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 5

Separability by two lines and by nearly straight polygonal chains

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Finding the Θ-guarded region

Computational Geometry: Theory and Applications
Separability by two lines and by nearly straight polygonal chains

Discrete Applied Mathematics
Some problems related to good illumination

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Fitting a two-joint orthogonal chain to a point set

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We introduce the unoriented $\Theta$-maximum as a new criterion for describing the shape of a set of planar points. We present efficient algorithms for computing the unoriented $\Theta$-maximum of a set of planar points. We also propose a simple linear expected time algorithm for computing the unoriented $\Theta$-maximum of a set of planar points when $\Theta=\pi/2$.