Abstract is missing.
- Some tools for modeling and analysis of surfacesCarsten Dorgerloh, Jens Luessem, Morakot Pilouk, Juergen Wirtgen.
- Contracted visibility graphs of line segmentsLaxmi Gewali, Jay Bagga, S. Dey, J. Emert, J. McGrew.
- Shooter location problems revisitedCao An Wang, Binhai Zhu.
- Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisitedMichael G. Lamoureux, Joseph Douglas Horton, Bradford G. Nickerson.
- Constructing piecewise linear homeomorphisms of polygons with holesMark Babikov, Diane L. Souvaine, Rephael Wenger.
- Analysis of a class of k-dimensional merge procedures, with an application to 2d delaunay triangulation in expected linear time after two-directional sortingChristophe Lemaire, Jean-Michel Moreau.
- Planar segment visibility graphsHazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy.
- An on-line algorithm for exploring an unknown polygonal environment by a point robotSubir Kumar Ghosh, Joel W. Burdick.
- Easy triangle strips for tin terrain modelsBettina Speckmann, Jack Snoeyink.
- Encoding a triangulation as a permutation of its point setMarkus Denny, Christian Sohler.
- On a partition of point sets into convex polygonsMasatsugu Urabe.
- The visibility graph contains a bounded-degree spannerGautam Das.
- An increasing-circle sweep-algorithm to construct the delaunay diagram in the planeBruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner.
- A note on the tree graph of a set of points in the planeEduardo Rivera-Campo, Virginia Urrutia-Galicia.
- The width of a convex set on the sphereFrancisco Javier Cobos, Juan Carlos Dana, Clara I. Grima, Alberto Márquez.
- Understanding discrete visibility and related approximation algorithmsSubir Kumar Ghosh, Joel W. Burdick.
- Geometric matching problem of disjoint compact convex sets by line segmentsKiyoshi Hosono, Katsumi Matsuda.
- Diameter of a set on the cylinderFrancisco Javier Cobos, Juan Carlos Dana, Clara I. Grima, Alberto Márquez.
- A balanced partition of points in the plane and tree embedding problemsAtsushi Kaneko.
- Handling rotations in the placement of curved convex polygonsFrancois Rebufat.
- Fast piercing of iso-oriented rectanglesChristos Makris, Athanasios K. Tsakalidis.
- Periodic b-spline surface skinning of anatomic shapesFabrice Jaillet, Behzad Shariat, Denis Vorpe.
- Parallel algorithms for longest increasing chains in the plane and related problemsMikhail J. Atallah, Danny Z. Chen, Kevin S. Klenk.
- Stability of voronoi neighborship under perturbations of the sitesFrank Weller.
- On folding rulers in regular polygonsNaixun Pei, Sue Whitesides.
- Walking in the visibility complex with applications to visibility polygons and dynamic visibilityStéphane Rivière.
- Partitioning algorithms for transportation graphs and their applications to routingCavit Aydin, Doug Ierardi.
- Sampling and reconstructing manifolds using alpha-shapesFausto Bernardini, Chandrajit L. Bajaj.
- On the number of internal and external visibility edges of polygonsJorge Urrutia.
- Almost optimal on-line search in unknown streetsEvangelos Kranakis, Anthony Spatharis.
- A straight-line embedding of two or more rooted trees in the planeM. Kano.
- Reconstruction of 3-D surface object from its piecesGöktürk Üçoluk, Ismail Hakki Toroslu.
- Biased search and k-point clusteringBinay K. Bhattacharya.
- Domino tilings and two-by-two squaresJurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia.
- Shape reconstruction using skeleton-based implicit surfaceSerge Pontier, Behzad Shariat, Denis Vorpe.
- The 3d visibility complex: a unified data-structure for global visibility of scenes of polygons and smooth objectsFrédo Durand, George Drettakis, Claude Puech.
- Label placement by maximum independent set in rectanglesPankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri.
- Some methods to determine the sign of a long integer from its remaindersToshiyuki Imai.
- Jin akiyamaNgoc-Minh Lê.
- A quadratic non-standard arthmeticDominique Michelucci.
- An iterative algorithm for the determination of voronoi vertices in polygonal and non-polygonal domainsFrancois Anton, Christopher M. Gold.
- On hardness of roundness calculationSergey P. Tarasov.