A counterexample to a dynamic algorithm for convex hulls of line arrangements

Binay Bhattacharya, Hazel Everett, Godfried Toussaint

Research output: Contribution to journalArticle

Abstract

An algorithm was recently published to maintain dynamically the convex hull of the set I of intersection points of a set L of n lines in the plane (Boreddy 1990). In other words, given the convex hull of I it is desired to update the convex hull when a new line is added to L (the insertion problem) and it is desired to update the convex hull when an old line is deleted from L (the deletion problem). No proofs of correctness are given in (Boreddy 1990). In fact, we show in this note that the deletion algorithm proposed is incorrect.

Original languageEnglish (US)
Pages (from-to)145-147
Number of pages3
JournalPattern Recognition Letters
Volume12
Issue number3
DOIs
StatePublished - Jan 1 1991

Keywords

  • Computational geometry
  • convex hull

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this

A counterexample to a dynamic algorithm for convex hulls of line arrangements. / Bhattacharya, Binay; Everett, Hazel; Toussaint, Godfried.

In: Pattern Recognition Letters, Vol. 12, No. 3, 01.01.1991, p. 145-147.

Research output: Contribution to journalArticle

@article{9c16f4e5899343a8aa5c7c9a5989956c,
title = "A counterexample to a dynamic algorithm for convex hulls of line arrangements",
abstract = "An algorithm was recently published to maintain dynamically the convex hull of the set I of intersection points of a set L of n lines in the plane (Boreddy 1990). In other words, given the convex hull of I it is desired to update the convex hull when a new line is added to L (the insertion problem) and it is desired to update the convex hull when an old line is deleted from L (the deletion problem). No proofs of correctness are given in (Boreddy 1990). In fact, we show in this note that the deletion algorithm proposed is incorrect.",
keywords = "Computational geometry, convex hull",
author = "Binay Bhattacharya and Hazel Everett and Godfried Toussaint",
year = "1991",
month = "1",
day = "1",
doi = "10.1016/0167-8655(91)90042-K",
language = "English (US)",
volume = "12",
pages = "145--147",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - A counterexample to a dynamic algorithm for convex hulls of line arrangements

AU - Bhattacharya, Binay

AU - Everett, Hazel

AU - Toussaint, Godfried

PY - 1991/1/1

Y1 - 1991/1/1

N2 - An algorithm was recently published to maintain dynamically the convex hull of the set I of intersection points of a set L of n lines in the plane (Boreddy 1990). In other words, given the convex hull of I it is desired to update the convex hull when a new line is added to L (the insertion problem) and it is desired to update the convex hull when an old line is deleted from L (the deletion problem). No proofs of correctness are given in (Boreddy 1990). In fact, we show in this note that the deletion algorithm proposed is incorrect.

AB - An algorithm was recently published to maintain dynamically the convex hull of the set I of intersection points of a set L of n lines in the plane (Boreddy 1990). In other words, given the convex hull of I it is desired to update the convex hull when a new line is added to L (the insertion problem) and it is desired to update the convex hull when an old line is deleted from L (the deletion problem). No proofs of correctness are given in (Boreddy 1990). In fact, we show in this note that the deletion algorithm proposed is incorrect.

KW - Computational geometry

KW - convex hull

UR - http://www.scopus.com/inward/record.url?scp=0025954970&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025954970&partnerID=8YFLogxK

U2 - 10.1016/0167-8655(91)90042-K

DO - 10.1016/0167-8655(91)90042-K

M3 - Article

VL - 12

SP - 145

EP - 147

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

SN - 0167-8655

IS - 3

ER -