David Avis, Prosenjit Bose, Thomas C. Shermer, Jack Snoeyink, Godfried Toussaint, Binhai Zhu  Home/Search
Context Related
| cgrl.cs.mcgill.ca/~godf...section.ps.gz mutt.cs.mcgill.ca/pub...ABSSTZ96a.ps.gz cgm.cs.mcgill.ca/~avi...ABSSTZ96a.ps.gz Cached: PS.gz PS PDF DjVu Image Update Help From: cgrl.cs.mcgill.ca/...publications (more) From: iro.umontreal.ca/~ratib/...socg96 Homepages: D.Avis P.Bose [2] [3] [4] T.Shermer J.Snoeyink G.Toussaint B.Zhu [2] [3] [4] HPSearch (Update Links) |
Rate this article:      (best)Comment on this article |
Abstract: Let K be a convex polytope in R d , let h(x) be the hyperplane consisting of all points with first coordinate equal to x, and let A(x) be the area (or volume, if d ? 3) of the section K " h(x). Using the Brunn-Minkowski inequality, we show that A(x) is a strictly unimodal function and give an algorithm to determine a hyperplane that achieves the maximum. Our algorithm runs in linear time, if the facial lattice of K is given. 1 Introduction A function f : R ! R is said to be unimodal if it... (Update)
Context of citations to this paper: More
...of the cross section of R and h(t) that is, #(t) vol d 1 (R # h(t) Because R is convex, the function # is unimodal. Avis et al. [1] prove this for convex polytopes using the Brunn Minkowski theorem, but the proof holds verbatim for arbitrary convex sets. Let t # be a...
...contact with v 2 Figure 1: Two convex polygons with Omega Gamma1 8 nm 2 n 2 m) distinct placements. Following Avis et al. [4], we can now apply the BrunnMinkowski theorem [13] which states that the square root of the function that describes the area of intersection of PPQ...
Cited by: More
Computing the Maximum Overlap of Two Convex.. - de Berg.. (1996) (Correct)
Finding Specified Sections of Arrangements: 2D Results - Bose, Hurtado, Meijer.. (2000) (Correct)
Guarding Scenes against Invasive Hypercubes - de Berg, David, Katz.. (1998) (Correct)
Similar documents (at the sentence level):
18.9%: On the Sectional Area of Convex Polytopes - Avis, Bose, Shermer, Snoeyink.. (1996) (Correct)
Active bibliography (related documents): More All
0.5: Characterizations of Convex and Star-Shaped Polygons - Shermer, Toussaint (1988) (Correct)
0.3: A Dido Problem as modernized by Fejes Tóth - Siegel (Correct)
0.3: An Isoperimetric Inequality for Self-Intersecting Polygons - Alan Siegel Courant (Correct)
Similar documents based on text: More All
0.3: Guarding Polyhedral Terrains - Bose, Shermer, Toussaint, Zhu (1992) (Correct)
0.3: Computing Geodesic Properties Inside a Simple Polygon - Toussaint (1989) (Correct)
0.3: Determining Sector Visibility of a Polygon - Bhattacharya, Kirkpatrick.. (1989) (Correct)
Related documents from co-citation: More All
5: Geometric pattern matching under Euclidean motion - Chew, Goodrich et al. - 1993
5: Approximate matching of polygonal shapes (context) - Alt, Behrends et al. - 1991
5: Applications of parametric searching in geometric optimization - Agarwal, Sharir et al. - 1992
BibTeX entry: (Update)
D. Avis, P. Bose, T. Shermer, J. Snoeyink, G. Toussaint, and B. Zhu. On the sectional area of convex polytopes. In Communication at the 12th Annu. ACM Sympos. Comput. Geom., page C, 1996. http://citeseer.nj.nec.com/article/avis96sectional.html More
@inproceedings{ avis96sectional,
author = "David Avis and Prosenjit Bose and Godfried T. Toussaint and Thomas C. Shermer and Binhai Zhu and Jack Snoeyink",
title = "On the Sectional Area of Convex Polytopes",
booktitle = "Symposium on Computational Geometry",
pages = "C-11-C-12",
year = "1996",
url = "citeseer.nj.nec.com/article/avis96sectional.html" }
Citations (may not include all citations):1102 Computational Geometry---An Introduction (context) - Preparata, Shamos - 1985
219 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
127 Time bounds for selection (context) - Blum, Floyd et al. - 1973
43 An optimal algorithm for intersecting three-dimensional conv.. (context) - Chazelle - 1992
35 Intersection of convex objects in two and three dimensions (context) - Chazelle, Dobkin - 1987
12 Complexity of polytope volume computation (context) - Khachiyan - 1993
11 A polyhedral representation for computer vision (context) - Baumgart - 1975
8 Tentative prune-and-search for computing fixed-points with a.. (context) - Kirpatrick, Snoeyink - 1995
7 Computing the maximum overlap of two convex polygons under t.. - de Berg, Devillers et al. - 1995
6 Computational geometry and convexity (context) - Chazelle - 1980
6 Sequential minimax search for a maximum (context) - Kiefer - 1953
5 A linear algorithm for bisecting a polygon (context) - Shermer - 1992
4 A characterization of convexity and central symmetry for pla.. (context) - Dharmadhikari, Jogdeo - 1973
3 an isoperimetric problem (context) - Pach - 1978
3 the multimodality of distances in convex polygons (context) - Avis, Toussaint et al. - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-cgrl.cs.mcgill.ca/~godfried/publications.html): More
The Graham Scan Triangulates Simple Polygons - Kong, Everett, Toussaint (1991) (Correct)
Guarding Polyhedral Terrains - Bose, Shermer, Toussaint, Zhu (1992) (Correct)
Optimal Algorithms for Computing the Minimum Distance.. - Toussaint, Bhattacharya (1981) (Correct)
Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback
CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute