External Links

    Journal: Comput. Geom.

    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