상세 보기
Finding the maximum bounded intersection of k out of n halfplanes
- Brass, Peter;
- Na, Hyeon-Suk
Citations
WEB OF SCIENCE
0Citations
SCOPUS
0초록
In this note we study the following question: Given n halfplanes, find the maximum-area bounded intersection of k halfplanes out of them. We solve this problem in O(n(3)k) time and O(n(2)k) space. (C) 2009 Elsevier B All rights reserved
키워드
Computational geometry; Algorithms; Maximum intersection; TRIANGLES
- 제목
- Finding the maximum bounded intersection of k out of n halfplanes
- 저자
- Brass, Peter; Na, Hyeon-Suk
- 발행일
- 2010-01-01
- 유형
- Article
- 권
- 110
- 호
- 3
- 페이지
- 113 ~ 115
- 출판사
- ELSEVIER SCIENCE BV
- 발행국가
- 네덜란드
- 분량
- 3 페이지
- ISSN
- P 0020-0190