• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 22 matches

• 1997
• 
  Arne Andersson, Kurt Swanson:
  On the Difficulty of Range Searching. Comput. Geom. 8: 115-122 (1997)
• 
  Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine:
  Testing Simple Polygons. Comput. Geom. 8: 97-114 (1997)
• 
  Boris Aronov, Micha Sharir:
  The Common Exterior of Convex Polygons in the Plane. Comput. Geom. 8: 139-149 (1997)
• 
  Gill Barequet, Matthew T. Dickerson, Petru Pau:
  Translating a Convex Polygon to Contain a Maximum Number of Points. Comput. Geom. 8: 167-179 (1997)
• 
  Mark de Berg, Marko de Groot, Mark H. Overmars:
  New Results on Binary Space Partitions in the Plane. Comput. Geom. 8: 317-333 (1997)
• 
  Gautam Das, Michael T. Goodrich:
  On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. Comput. Geom. 8: 123-137 (1997)
• 
  Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill:
  Triangulating with High Connectivity. Comput. Geom. 8: 39-56 (1997)
• 
  Tamal K. Dey, Nimish R. Shah:
  On the Number of Simplicial Complexes in D. Comput. Geom. 8: 267-277 (1997)
• 
  Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl:
  Fast Greedy Triangulation Algorithms. Comput. Geom. 8: 67-86 (1997)
• 
  David Eppstein:
  Faster Geometric K-point MST Approximation. Comput. Geom. 8: 231-240 (1997)
• 
  Sándor P. Fekete, Gerhard J. Woeginger:
  Angle-Restricted Tours in the Plane. Comput. Geom. 8: 195-218 (1997)
• 
  Komei Fukuda, Thomas M. Liebling, François Margot:
  Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron. Comput. Geom. 8: 1-12 (1997)
• 
  Subir Kumar Ghosh, Sanjeev Saluja:
  Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets. Comput. Geom. 8: 241-266 (1997)
• 
  Jens Gravesen:
  Adaptive Subdivision and the Length and Energy of Bézier Curves. Comput. Geom. 8: 13-31 (1997)
• 
  Neelima Gupta, Sandeep Sen:
  Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. Comput. Geom. 8: 151-166 (1997)
• 
  Johann Hagauer, Günter Rote:
  Three-clustering of Points in the Plane. Comput. Geom. 8: 87-95 (1997)
• 
  Matthew J. Katz:
  3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects. Comput. Geom. 8: 299-316 (1997)
• 
  Ngoc-Minh Lê:
  Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-space. Comput. Geom. 8: 279-298 (1997)
• 
  Marisa Mazón, Tomás Recio:
  Voronoi Diagrams on Orbifolds. Comput. Geom. 8: 219-230 (1997)
• 
  Edgar A. Ramos:
  Intersection of Unit-balls and Diameter of a Point Set in 3. Comput. Geom. 8: 57-65 (1997)
• 
  Géza Tóth:
  The Shortest Distance Among Points in General Position. Comput. Geom. 8: 33-38 (1997)
• 
  Binhai Zhu:
  Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time. Comput. Geom. 8: 181-193 (1997)