• 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 42 matches

• 1985
• 
  Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap:
  Finding minimal convex nested polygons. SCG 1985: 296-304
• 
  David Avis:
  On the partitionability of point sets in space (preliminary report). SCG 1985: 116-120
• 
  David Avis, David Rappaport:
  Computing the largest empty convex subset of a set of points. SCG 1985: 161-167
• 
  Jean-Daniel Boissonnat:
  Reconstruction of solids. SCG 1985: 46-54
• 
  Bernard Chazelle:
  New techniques for computing order statistics in Euclidean space (extended abstract). SCG 1985: 125-134
• 
  Bernard Chazelle, Herbert Edelsbrunner:
  An improved algorithm for constructing kth-order Voronoi diagrams. SCG 1985: 228-234
• 
  Bernard Chazelle, Leonidas J. Guibas:
  Visibility and intersectin problems in plane geometry. SCG 1985: 135-146
• 
  Bernard Chazelle, Franco P. Preparata:
  Halfspace range search: an algorithmic application of K-sets. SCG 1985: 107-115
• 
  L. Paul Chew:
  Planning the shortest path for a disc in O(n²log n) time. SCG 1985: 214-220
• 
  L. Paul Chew, Robert L. (Scot) Drysdale III:
  Voronoi diagrams based on convex distance functions. SCG 1985: 235-244
• 
  Joseph C. Culberson, Gregory J. E. Rawlins:
  Turtlegons: generating simple polygons for sequences of angles. SCG 1985: 305-310
• 
  Norm Dadoun, David G. Kirkpatrick, John P. Walsh:
  The geometry of beam tracing. SCG 1985: 55-61
• 
  Glenn Davis:
  Computing separating planes for pairs of disjoint polytopes. SCG 1985: 8-14
• 
  Frank K. H. A. Dehne, Hartmut Noltemeier:
  A computational geometry approach to clustering problems. SCG 1985: 245-250
• 
  Herbert Edelsbrunner, Raimund Seidel:
  Voronoi diagrams and arrangements. SCG 1985: 251-262
• 
  Otfried Fries, Kurt Mehlhorn, Stefan Näher:
  Dynamization of geometric data structures. SCG 1985: 168-176
• 
  Teofilo F. Gonzalez, Si-Qing Zheng:
  Bounds for partitioning rectilinear polygons. SCG 1985: 281-287
• 
  Jacob E. Goodman, Richard Pollack:
  Modeling planar configurations. SCG 1985: 121-124
• 
  Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann:
  The direct dominance problem. SCG 1985: 81-88
• 
  Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan:
  Sorting Jordan sequences in linear time. SCG 1985: 196-203
• 
  Michael E. Houle, Godfried T. Toussaint:
  Computating the width of a set. SCG 1985: 1-7
• 
  Deborah A. Joseph, W. Harry Plantinga:
  On the complexity of reachability and motion planning questions (extended abstract). SCG 1985: 62-66
• 
  Klara Kedem, Micha Sharir:
  An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles. SCG 1985: 75-80
• 
  David G. Kirkpatrick, Raimund Seidel:
  Output-size sensitive algorithms for finding maximal vectors. SCG 1985: 89-96
• 
  A. Koutsou:
  A geometric reasoning system for moving an object while maintaining contact with others. SCG 1985: 67-74
• 
  Daniel Leven, Micha Sharir:
  An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract). SCG 1985: 221-227
• 
  Andrzej Lingas:
  On partitioning polygons. SCG 1985: 288-295
• 
  Richard J. Lipton, Stephen C. North, Jonathan S. Sandberg:
  A method for drawing graphs. SCG 1985: 153-160
• 
  James J. Little:
  Extended Gaussian images, mixed volumes, shape reconstruction. SCG 1985: 15-23
• 
  Anna Lubiw:
  Decomposing polygonal regions into convex quadrilaterals. SCG 1985: 97-106

skipping 12 more matches