External Links

    Journal: Comput. Geom.

    Volume 40, Issue 3

    179 -- 194Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff. Constructing minimum-interference networks
    195 -- 206Sergio Cabello, José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura. Covering point sets with two disjoint disks or squares
    207 -- 219Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron. Sparse geometric graphs with small dilation
    220 -- 230Manuel Abellanas, Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia. Augmenting the connectivity of geometric graphs
    231 -- 251Eli Packer. Iterated snap rounding with bounded drift
    252 -- 271Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh. I/O-efficient algorithms for computing planar geometric spanners

    Volume 40, Issue 2

    93 -- 101Franz Aurenhammer. Weighted skeletons and fixed-share decomposition
    102 -- 114Mirela Damian, Robin Y. Flatland, Joseph O Rourke. Unfolding Manhattan Towers
    115 -- 137Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthias John. Recursive geometry of the flow complex and topology of the flow complex filtration
    138 -- 147Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth. Drawing cubic graphs with at most five slopes
    148 -- 155Masud Hasan, Anna Lubiw. Equiprojective polyhedra
    156 -- 170Frédéric Chazal, André Lieutier. Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees
    171 -- 177Hee-Kap Ahn, Peter Brass, Chan-Su Shin. Maximum overlap and minimum convex hull of two convex polyhedra under translations

    Volume 40, Issue 1

    1 -- 13Christian Wulff-Nilsen. Steiner hull algorithm for the uniform orientation metrics
    14 -- 22Mihai Badoiu, Kenneth L. Clarkson. Optimal core-sets for balls
    23 -- 36Ansgar Grüne, Sanaz Kamali. On the density of iterated line segment intersections
    37 -- 44Sergey Bereg. Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
    45 -- 60Xuehou Tan. A unified and efficient solution to the room search problem
    61 -- 78Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap. Classroom examples of robustness problems in geometric computations
    79 -- 83Oswin Aichholzer, Clemens Huemer, Hannes Krasser. Triangulations without pointed spanning trees
    84 -- 91Nabil H. Mustafa, Saurabh Ray. Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension
    runs on