Kinetic visibility

[1]  Frédo Durand,et al.  A Survey of Visibility for Walkthrough Applications , 2003, IEEE Trans. Vis. Comput. Graph..

[2]  G. Rote,et al.  Planar minimally rigid graphs and pseudo-triangulations , 2003, SCG '03.

[3]  Xiang-Yang Li,et al.  Coverage in Wireless Ad Hoc Sensor Networks , 2003, IEEE Trans. Computers.

[4]  Menelaos I. Karavelas,et al.  Voronoi Diagrams for Moving Disks and Applications , 2001, WADS.

[5]  Jie Wu,et al.  Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[6]  Carlo H. Séquin,et al.  Occlusion horizons for driving through urban scenery , 2001, I3D '01.

[7]  Ileana Streinu,et al.  A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[8]  François X. Sillion,et al.  Conservative volumetric visibility with occluder fusion , 2000, SIGGRAPH.

[9]  Michael Wimmer,et al.  Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs , 2000, Rendering Techniques.

[10]  Giora Slutzki,et al.  An algorithm for searching a polygonal region with a flashlight , 2000, SCG '00.

[11]  David A. Forsyth,et al.  Interactive ray tracing with the visibility complex , 1999, Comput. Graph..

[12]  Seth J. Teller,et al.  Temporally coherent conservative visibility , 1999, Comput. Geom..

[13]  Leonidas J. Guibas,et al.  Visibility Queries in Simple Polygons and Applications , 1998, ISAAC.

[14]  Leonidas J. Guibas,et al.  Separation-sensitive collision detection for convex objects , 1998, SODA '99.

[15]  Daniel Cohen-Or,et al.  Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes , 1998, Comput. Graph. Forum.

[16]  Chuck Hansen,et al.  Eurographics '97 , 1998, COMG.

[17]  Frédo Durand,et al.  The 3d visibility complex: a unified data-structure for global visibility of scenes of polygons and smooth objects , 1997, CCCG.

[18]  Dinesh Manocha,et al.  Visibility culling using hierarchical occlusion maps , 1997, SIGGRAPH.

[19]  Stéphane Rivière,et al.  Dynamic visibility in polygonal scenes with the visibility complex , 1997, SCG '97.

[20]  Seth J. Teller,et al.  Real-time occlusion culling for models with large occluders , 1997, SI3D.

[21]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[22]  Frédo Durand,et al.  The 3D Visibility Complex: A New Approach to the Problems of Accurate Visibility , 1996, Rendering Techniques.

[23]  A. James Stewart,et al.  Incremental update of the visibility map as seen by a moving viewpoint in two dimensions , 1996 .

[24]  Frédo Durand,et al.  Using the Visibility Complex for Radiosity Computation , 1996, WACG.

[25]  A. James Stewart,et al.  Maintenance of the set of segments visible from a moving viewpoint in two dimensions , 1996, SCG '96.

[26]  Michel Pocchiola,et al.  Pseudo-triangulations: theory and applications , 1996, SCG '96.

[27]  Michel Pocchiola,et al.  Topologically sweeping visibility complexes via pseudotriangulations , 1996, Discret. Comput. Geom..

[28]  Philip M. Hubbard,et al.  Collision Detection for Interactive Graphics Applications , 1995, IEEE Trans. Vis. Comput. Graph..

[29]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[30]  James Abello,et al.  Visibility Graphs and Oriented Matroids , 1994, GD.

[31]  Susan E. Dorward.  A survey of object-space hidden surface removal , 1994, Int. J. Comput. Geom. Appl..

[32]  Robert L. Grossman,et al.  Visibility with a moving point of view , 1994, SODA '90.

[33]  Michel Pocchiola,et al.  The visibility complex , 1993, SCG '93.

[34]  B. Sturmfels.  Oriented Matroids , 1993 .

[35]  Carlo H. Séquin,et al.  Visibility preprocessing for interactive walkthroughs , 1991, SIGGRAPH.

[36]  Stephen Cameron,et al.  Collision detection by four-dimensional intersection testing , 1990, IEEE Trans. Robotics Autom..

[37]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[38]  Leonidas J. Guibas,et al.  Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[39]  David M. Mount,et al.  An output sensitive algorithm for computing visibility graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[40]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[41]  John Amanatides,et al.  Ray tracing with cones , 1984, SIGGRAPH.

[42]  Mikhail J. Atallah,et al.  Dynamic computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[43]  Steven W. Zucker,et al.  Frame-to-frame coherence and the hidden surface computation: constraints for a convex world , 1982, TOGS.

[44]  Franco P. Preparata,et al.  An optimal real-time algorithm for planar convex hulls , 1979, CACM.

[45]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[46]  Robert A. Schumacker,et al.  A Characterization of Ten Hidden-Surface Algorithms , 1974, CSUR.

[47]  R. Schmacher,et al.  Study for Applying Computer-Generated Images to Visual Simulation: (510842009-001) , 1969 .

[48]  Leonidas J. Guibas,et al.  Kinetic Data Structures , 2004, Handbook of Data Structures and Applications.

[49]  Claude Puech,et al.  A Simple Kinetic Visibility Polygon , 2002 .

[50]  Mark de Berg,et al.  Realistic Input Models for Geometric Algorithms , 2002, Algorithmica.

[51]  Michel Pocchiola,et al.  A 'Sum of Squares' Theorem for Visibility Complexes , 2000, SoCG 2000.

[52]  K. Nechvíle,et al.  Dynamic Visibility in the Plane , 1999 .

[53]  L. Guibas,et al.  Kinetic vertical decomposition trees , 1999 .

[54]  K. Nechvíle,et al.  Local Approach to Dynamic Visibility in the Plane , 1999 .

[55]  Craig Gotsman,et al.  Dynamic Scene Occlusion Culling , 1998, IEEE Trans. Vis. Comput. Graph..

[56]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[57]  Frédo Durand,et al.  The Visibility Complex made Visibly Simple , 1995 .

[58]  Seth Teller,et al.  Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .

[59]  Derek G. Corneil,et al.  Visibility graph recognition , 1990 .