Skip to main navigation Skip to search Skip to main content

On minimum-area hulls: (Extended abstract)

  • Stony Brook University
  • University of Salzburg
  • Polytechnic University of Catalonia
  • Kyungsung University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

We study some minimum-area hull problems that generalize the notion of convex hull to star-shaped and monotone hulls. Specifically, we consider the minimum-area star-shaped hull problem: Given an n-vertex simple polygon P, find a minimum-area, star-shaped polygon P* containing P. We also consider the case in which P* is required to be monotone (the minimum-area monotone hull problem).

Original languageEnglish
Title of host publicationAlgorithms - ESA 1996 - 4th Annual European Symposium, Proceedings
EditorsJosep Diaz, Maria Serna
PublisherSpringer Verlag
Pages334-348
Number of pages15
ISBN (Print)3540616802, 9783540616801
DOIs
StatePublished - 1996
Event4th European Symposium on Algorithms, ESA 1996 - Barcelona, Spain
Duration: Sep 25 1996Sep 27 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1136

Conference

Conference4th European Symposium on Algorithms, ESA 1996
Country/TerritorySpain
CityBarcelona
Period09/25/9609/27/96

Fingerprint

Dive into the research topics of 'On minimum-area hulls: (Extended abstract)'. Together they form a unique fingerprint.

Cite this