External Links

    Journal: Comput. Geom.

    Volume 41, Issue 3

    111 -- 125Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle. Reporting flock patterns
    126 -- 148Afra Zomorodian, Gunnar Carlsson. Localized homology
    149 -- 166Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci, Jack Snoeyink. Time-varying Reeb graphs for continuous space-time data
    167 -- 187Nir Goldschmidt, Dan Gordon. The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing
    188 -- 205Otfried Cheong, Herman J. Haverkort, Mira Lee. Computing a minimum-dilation spanning tree is NP-hard
    206 -- 218Jorge Caravantes, Laureano González-Vega. Improving the topology computation of an arrangement of cubics
    219 -- 229Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop. Optimal location of transportation devices
    230 -- 246Carla Binucci, Walter Didimo, Francesco Giordano. Maximum upward planar subgraphs of embedded planar digraphs

    Volume 41, Issue 1-2

    1 -- 0Ioannis Z. Emiris, Leonidas Palios. Editorial
    2 -- 20Kevin Buchin, Maike Buchin, Carola Wenk. Computing the Fréchet distance between simple polygons
    21 -- 30Stefan Gerdjikov, Alexander Wolff. Decomposing a simple polygon into pseudo-triangles and convex polygons
    31 -- 47Robert L. Scot Drysdale, Günter Rote, Astrid Sturm. Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
    48 -- 67Esther Moet, Marc J. van Kreveld, A. Frank van der Stappen. On realistic terrains
    68 -- 76Boris Aronov, Mark de Berg, Chris Gray. Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
    77 -- 93Esther Ezra, Micha Sharir, Alon Efrat. On the performance of the ICP algorithm
    94 -- 110Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey. Splitting (complicated) surfaces is hard
    runs on