Table of Contents

• Accelerated Occlusion Culling using Shadow FrustaThomas C. Hudson, Dinesh Manocha, Jonathan D. Cohen, Ming C. Lin, Kenneth E. Hoff III, Hansong Zhang. 1-10 [doi]
• Bucket-Like Space Partitioning Data Structures with Applications to Ray-TracingFrédéric Cazals, Claude Puech. 11-20 [doi]
• On Fence Design and the Complexity of Push Plans for Orienting PartsRobert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen. 21-29 [doi]
• On Levels in Arrangements of Lines, Segments, Planes, and TrianglesPankaj K. Agarwal, Boris Aronov, Micha Sharir. 30-38 [doi]
• Cylindrical Static and Kinetic Binary Space PartitionsPankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter. 39-48 [doi]
• Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version)David Bremner, Komei Fukuda, Ambros Marzetta. 49-56 [doi]
• Construction of 1-d Lower Envelopes and ApplicationsEdgar A. Ramos. 57-66 [doi]
• Minkowski Operations for Satellite Antenna LayoutJean-Daniel Boissonnat, Eelco de Lange, Monique Teillaud. 67-76 [doi]
• Necessary Conditions for Boundary Representation VarianceSrinivas Raghothama, Vadim Shapiro. 77-86 [doi]
• Choosing Corners of Rectangles for Mapped MeshingScott A. Mitchell. 87-93 [doi]
• Ramsey-Type Results for Geometric Graphs IIGyula Károlyi, János Pach, Géza Tóth, Pavel Valtr. 94-103 [doi]
• On the Complexity of the Union of Fat Objects in the PlaneAlon Efrat, Micha Sharir. 104-112 [doi]
• A Complete Roundness Classification ProcedureKurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap. 129-138 [doi]
• The Discrete 2-Center ProblemPankaj K. Agarwal, Micha Sharir, Emo Welzl. 147-155 [doi]
• Robust Proximity Queries: An Illustration of Degree-Driven Algorithm DesignGiuseppe Liotta, Franco P. Preparata, Roberto Tamassia. 156-165 [doi]
• Efficient Exact Evaluation of Signs of DeterminantsHervé Brönnimann, Mariette Yvinec. 166-173 [doi]
• Computing Exact Geometric Predicates Using Modular Arithmetic with Single PrecisionHervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion. 174-182 [doi]
• A Perturbation Scheme for Spherical Arrangements with Application to Molecular ModelingDan Halperin, Christian R. Shelton. 183-192 [doi]
• Minimum Strictly Convex Quadrangulations of Convex PolygonsMatthias Müller-Hannemann, Karsten Weihe. 193-202 [doi]
• Average-Case Ray Shooting and Minimum Weight TriangulationsBoris Aronov, Steven Fortune. 203-211 [doi]
• Contour Trees and Small Seed Sets for Isosurface TraversalMarc J. van Kreveld, René van Oostrum, Chandrajit L. Bajaj, Valerio Pascucci, Daniel Schikore. 212-220 [doi]
• Separating an Object from its CastHee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf. 221-230 [doi]
• A Data Front-End for Layered ManufacturingGill Barequet, Yuval Kaplan. 231-239 [doi]
• Wall Thickness Control in Layered ManufacturingSeth Allen, Debasish Dutta. 240-247 [doi]
• ::::r::::-Regular Shape Reconstruction from Unorganized PointsDominique Attali. 248-253 [doi]
• A Computational Basis for Higher-Dimensional Computational Geometry and ApplicationsKurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler. 254-263 [doi]
• A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract)Cristian S. Mata, Joseph S. B. Mitchell. 264-273 [doi]
• Approximating Weighted Shortest Paths on Polyhedral SurfacesMark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack. 274-283 [doi]
• Snap Rounding Line Segments Efficiently in Two and Three DimensionsMichael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum. 284-293 [doi]
• Realistic Input Models for Geometric AlgorithmsMark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels. 294-303 [doi]
• Space-Time Tradeoffs for Emptiness Queries (Extended Abstract)Jeff Erickson. 304-313 [doi]
• Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point SetsTatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama. 314-323 [doi]
• RAPID: Randomized Pharmacophore Identification for Drug DesignPaul W. Finn, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian, A. Yao. 324-333 [doi]
• Rotational Polygon Overlap MinimizationVictor Milenkovic. 334-343 [doi]
• Proximity Problems on Moving PointsJulien Basch, Leonidas J. Guibas, Li Zhang. 344-351 [doi]
• Approximate Nearest Neighbor Queries RevisitedTimothy M. Chan. 352-358 [doi]
• Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three DimensionsSariel Har-Peled. 359-365 [doi]
• ::::A::::-Shapes of a Finite Point SetMahmoud Melkemi. 367-369 [doi]
• Drawing Closed Rational SurfacesJean H. Gallier. 370-372 [doi]
• Fast Collision Detection Among Multiple Moving SpheresDong Jin Kim, Leonidas J. Guibas, Sung Yong Shin. 373-375 [doi]
• GASP-II: A Geometric Algorithm Animation System for an Electronic ClassroomMaria Shneerson, Ayellet Tal. 379-381 [doi]
• Practical Techniques for Constructing Binary Space Partitions for Orthogonal RectanglesPankaj K. Agarwal, T. M. Murali, Jeffrey Scott Vitter. 382-384 [doi]
• Assembling Objects Through Parts CorrelationPamela J. Vermeer. 385-387 [doi]
• A Practical Evaluation of Kinetic Data StructuresJulien Basch, Leonidas J. Guibas, Craig Silverstein, Li Zhang. 388-390 [doi]
• Guaranteed-Quality Delaunay Meshing in 3D (Short Version)L. Paul Chew. 391-393 [doi]
• Geometric Decision Trees for Optical Character Recognition (Extended Abstract)George N. Sazaklis, Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena. 394-396 [doi]
• A Wavelet Approach to Foveating ImagesEe-Chien Chang, Chee-Keng Yap. 397-399 [doi]
• Good Orders for Incremental (Re)constructionJack Snoeyink, Marc J. van Kreveld. 400-402 [doi]
• Algorithmic Tolerances and Semantics in Data ExchangeThomas J. Peters, Neil F. Stewart, David R. Ferguson, P. S. Fussell. 403-405 [doi]
• A General Method for Partial Point Set MatchingMichiel Hagedoorn, Remco C. Veltkamp. 406-408 [doi]
• An Interactive Environment for Visualizing and Animating AlgorithmsJürgen Döllner, Klaus Hinrichs, Hermann Spiegel. 409-411 [doi]
• Classical Computational Geometry in GeomNetGill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia. 412-414 [doi]
• Empirical Testing of Algorithms for Variable-Sized Label PlacementJon Christensen, Stacy Friedman, Joe Marks, Stuart M. Shieber. 415-417 [doi]
• Voronoi Diagrams for Direction-Sensitive DistancesOswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou. 418-420 [doi]
• Dynamic Visibility in Polygonal Scenes with the Visibility ComplexStéphane Rivière. 421-423 [doi]
• New Competitive Strategies for Searching in Unknown Star-Shaped PolygonsJae-Ha Lee, Chan-Su Shin, Jae-Hoon Kim, Sung Yong Shin, Kyung-Yong Chwa. 427-429 [doi]
• Exact Primitives for Smallest Enclosing EllipsesBernd Gärtner, Sven Schönherr. 430-432 [doi]
• Piecewise Linear Approximation of Bézier-CurvesHelmut Alt, Emo Welzl, Barbara Wolfers. 433-435 [doi]
• On Exact Solutions for the Rectilinear Steiner Tree ProblemUlrich Fößmeier, Michael Kaufmann. 436-438 [doi]
• Clusters of StarsIleana Streinu. 439-441 [doi]
• Probabilistic Analysis for Combinatorial Functions of Moving PointsLi Zhang, Harish Devarajan, Julien Basch, Piotr Indyk. 442-444 [doi]
• Position-Independent Near Optimal Searching and On-Line Recognition in Star PolygonsAlejandro López-Ortiz, Sven Schuierer. 445-447 [doi]
• Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract)Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda. 448-450 [doi]
• A Polynomial Time Solution for Labeling a Rectilinear MapChung Keung Poon, Binhai Zhu, Franis Chin. 451-453 [doi]
• Time-Series Similarity Problems and Well-Separated Geometric SetsBéla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila. 454-456 [doi]
• The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector FieldsKarl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin. 457-459 [doi]
• Efficient Breakout Routing in Printed Circuit BoardsJohn Hershberger, Subhash Suri. 460-462 [doi]
• Voronoi Diagram in Statistical Parametric Space by Kullback-Leibler DivergenceKensuke Onishi, Hiroshi Imai. 463-465 [doi]
• Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric SearchJörg Schwerdt, Michiel H. M. Smid, Stefan Schirra. 466-468 [doi]
• Sweeping Lines and Line Segments with a HeapJulien Basch, Leonidas J. Guibas, G. D. Ramkumar. 469-471 [doi]
• The Bisector Surface of Freeform Rational Space CurvesGershon Elber, Myung-Soo Kim. 473-474 [doi]
• 3D Visibility Made Visibly Simple: An Introduction to the Visibility SkeletonFrédo Durand, George Drettakis, Claude Puech. 475-476 [doi]
• Application of an Effective Geometric Clustering Method to the Color Quantization ProblemMary Inaba, Hiroshi Imai, Motoki Nakade, Tatsurou Sekiguchi. 477-478 [doi]
• Animating the Polygon-Offset Distance FunctionGill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich. 479-480 [doi]
• A Triangulation-Based Object Reconstruction MethodFausto Bernardini, Chandrajit L. Bajaj, Jindong Chen, Daniel Schikore. 481-484 [doi]
• Approximating Weighted Shortest Paths on Polyhedral SurfacesMark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack. 485-486 [doi]
• Back-Face Computation of Polygon ClustersSubodh Kumar, Dinesh Manocha, William F. Garrett, Ming C. Lin. 487-488 [doi]