The Superman problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Aug 1994 English Publisher:Springer Science and Business Media LLCJournal:The Visual Computer, volume 10, pages 459-473 (issn: 0178-2789, eissn: 1432-8726,

Copyright policy )

Authors: Naji Mouawad; Thomas C. Shermer;

doi: 10.1007/bf01910636

The Superman problem

- Summary
- Metrics

Abstract

Given a polygonK contained in a polygonP, and a points lying outsideP, we present a Θ (n logn) algorithm that finds the minimum number of edges, ofP that we want to retain in order to hidek froms. Furthermore, if the visibility polygon ofs givenK is unbounded, the algorithm is shown to run in linear time. This paper is dedicated to J. Siegel and J. Shuster.

Related Organizations

University of Waterloo
Canada

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	5
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average