# Last edited on 2003-06-08 23:39:32 by stolfi

# Papers that cite papers by Jorge Stolfi.
# Collected from ISI Science Citations on 2003-06-08. 

# ======================================================================
# INDEXED PUBLICATIONS
# Key: AU=(STOLFI J)
# Excluding three false hits (pre 1973, medical subject).

@item{
  author = {Leitao HCD, Stolfi J}
  title = {A multiscale method for the reassembly of two-dimensional fragmented objects}
  where = {IEEE T PATTERN ANAL 24 (9): 1239-1251 SEP 2002}
}

@item{
  author = {Neto CFXD, Schaffer K, Xavier EF, et al.}
  title = {The splitting number and skewness of C-n x C-m}
  where = {ARS COMBINATORIA 63: 193-205 APR 2002}
}

@item{
  author = {Vinicius M, Andrade A, Stolfi J}
  title = {Exact algorithms for circles on the sphere}
  where = {INT J COMPUT GEOM AP 11 (3): 267-290 JUN 2001}
}

@item{
  author = {Gomide A, Stolfi J}
  title = {Bases for non-homogeneous polynomial C-k splines on the sphere}
  where = {LECT NOTES COMPUT SC 1380: 133-140 1998}
}

@item{
  author = {deFigueiredo LH, Stolfi J}
  title = {Adaptive enumeration of implicit surfaces with affine arithmetic}
  where = {COMPUT GRAPH FORUM 15 (5): 287-296 DEC 1996}
}

@item{
  author = {Chazelle B, Edelsbrunner H, Guibas LJ, et al.}
  title = {Lines in space: Combinatorics and algorithms}
  where = {ALGORITHMICA 15 (5): 428-447 MAY 1996}
}

@item{
  author = {SNOEYINK J, STOLFI J}
  title = {OBJECTS THAT CANNOT BE TAKEN APART WITH 2 HANDS}
  where = {DISCRETE COMPUT GEOM 12 (3): 367-384 OCT 1994}
}

@item{
  author = {GUIBAS L, SALESIN D, STOLFI J}
  title = {CONSTRUCTING STRONGLY CONVEX APPROXIMATE HULLS WITH INACCURATE PRIMITIVES}
  where = {ALGORITHMICA 9 (6): 534-560 JUN 1993}
}

@item{
  author = {GUIBAS L, SALESIN D, STOLFI J}
  title = {CONSTRUCTING STRONGLY CONVEX APPROXIMATE HULLS WITH INACCURATE PRIMITIVES}
  where = {LECT NOTES COMPUT SC 450: 261-270 1990}
}

@item{
  author = {SHALLIT J, STOLFI J}
  title = {2 METHODS FOR GENERATING FRACTALS}
  where = {COMPUT GRAPH 13 (2): 185-191 1989}
}

@item{
  author = {GUIBAS LJ, STOLFI J, CLARKSON KL}
  title = {SOLVING RELATED TWO-DIMENSIONAL AND 3-DIMENSIONAL LINEAR-PROGRAMMING PROBLEMS IN LOGARITHMIC TIME}
  where = {THEOR COMPUT SCI 49 (1): 81-84 1987}
}

@item{
  author = {EDELSBRUNNER H, GUIBAS LJ, STOLFI J}
  title = {OPTIMAL POINT LOCATION IN A MONOTONE SUBDIVISION}
  where = {SIAM J COMPUT 15 (2): 317-340 MAY 1986}
}

@item{
  author = {GUIBAS L, STOLFI J}
  title = {PRIMITIVES FOR THE MANIPULATION OF GENERAL SUBDIVISIONS AND THE COMPUTATION OF VORONOI DIAGRAMS}
  where = {ACM T GRAPHIC 4 (2): 74-123 1985}
}

@item{
  author = {GUIBAS LJ, STOLFI J}
  title = {ON COMPUTING ALL NORTHEAST NEAREST NEIGHBORS IN THE L1 METRIC}
  where = {INFORM PROCESS LETT 17 (4): 219-223 1983}
}

# ======================================================================
# CITATIONS TO "STOLFI J" FOUND IN ALL INDEXED DOCUMENTS (CONDENSED).
# 
# Includes all the Citation Search hits for author "STOLFI J" (minus 2
# spurious entries --- both pre-1979 and in medical journals), plus one
# hit for author "STOLFI" alone.
# 
# In the list below, different citation entries for the same paper
# were combined manually. The first column indicates whether the
# publication is indexed.
# 
# X Hits    Cited Author  Cited Work                Vol Page Year
# = ====    ============  ========================  === ==== ====
# *  215    STOLFI J      ACM_T_GRAPHIC               4   74 1985 
# *  146    STOLFI J      SIAM_J_COMPUT              15  317 1986 
# *   12    STOLFI J      ALGORITHMICA                9  534 1993 
# *   12    STOLFI J      COMPUT_GRAPH               13  185 1989 
# *   11    STOLFI J      INFORM_PROCESS_LETT        17  219 1983  
# *    8    STOLFI J      ALGORITHMICA               15  428 1996 
# *    7    STOLFI J      COMPUT_GRAPH_FORUM         15  287 1996 
# *    3    STOLFI J      DISCRETE_COMPUT_GEOM       12  367 1994 
# *    3    STOLFI J      LECT_NOTES_COMPUT_SC      450  261 1990 
# *    3    STOLFI J      THEOR_COMPUT_SCI           49   81 1987 
# 
# -   31    STOLFI J      ORIENTED_PROJECTIVE         -    - 1991
# 
# -   12    STOLFI J      36_DEC_SRC_PRIMITIVES       -    - 1989
# 
# -    3    STOLFI J      THESIS_STANFORD_U           -    - 1989
# 
# -    6    STOLFI J      21_BRAZ_MATH_COLL_IMPA      -    - 1997 
# 
# -    6    STOLFI J      PROC_3RD_ACM_S_COMP_GEO     -   76 1987 
# 
# -    1    STOLFI J      AFFINE_ARITHMETIC_CO        -    -    -
# 
# -    1    STOLFI J      AFFINE_ARITHMETIC_SO        -    - 1993
# 
# -    1    STOLFI J      AM_MATH_MONTHLY_JUN         -  479 1986 
# 
# -    1    STOLFI J      COMMUNICATION               -    - 1994
# 
# Total 482 citations.
# 
# Here are the citations to the medical "J STOLFI"
# 
# X Hits    Cited Author  Cited Work                Vol Page Year
# = ====    ============  ========================  === ==== ====
# -  12     STOLFI J      AM_J_DIS_CHILD            123  507 1972 
# -   1     STOLFI J      NY_STATE_J_MED_APR          -    - 1979
   
# ======================================================================   
# ARTICLES THAT CITE SPECIFIC PUBLICATIONS:
#  

# ----------------------------------------------------------------------
# CONSTRUCTING STRONGLY CONVEX APPROXIMATE HULLS WITH INACCURATE PRIMITIVES
# GUIBAS L, SALESIN D, STOLFI J
# ALGORITHMICA
# 9 (6): 534-560 JUN 1993
# ----------------------------------------------------------------------

@item{
  author = {Chen W, Wada K, Kawaguchi K}
  title = {Robust algorithms for constructing strongly convex hulls in parallel}
  where = {THEOR COMPUT SCI 289 (1): 277-295 OCT 23 2002}
}

@item{
  author = {Nagai T, Tokura N}
  title = {Tight error bounds of geometric problems on convex objects with imprecise coordinates}
  where = {LECT NOTES COMPUT SC 2098: 252-263 2001}
}

@item{
  author = {Chen W, Deng XW, Wada KC, et al.}
  title = {Constructing a strongly convex superhull of points}
  where = {INT J COMPUT GEOM AP 11 (5): 487-502 OCT 2001}
}

@item{
  author = {Mehlhorn K}
  title = {From algorithm to program to software library}
  where = {LECT NOTES COMPUT SC 2000: 268-273 2001}
}

@item{
  author = {Pal S, Datta A, Pal NR}
  title = {A multilayer self-organizing model for convex-hull computation}
  where = {IEEE T NEURAL NETWOR 12 (6): 1341-1347 NOV 2001}
}

@item{
  author = {Datta A, Pal S, Pal NR}
  title = {A connectionist model for convex-hull of a planar set}
  where = {NEURAL NETWORKS 13 (3): 377-384 APR 2000}
}

@item{
  author = {Castanho CD, Chen W, Wada K}
  title = {A parallel algorithm for constructing strongly convex superhulls of points}
  where = {IEICE T FUND ELECTR E83A (4): 722-732 APR 2000}
}

@item{
  author = {Chen W, Nakano K, Wada K}
  title = {Parallel algorithms for convex hull problems and their paradigm}
  where = {IEICE T INF SYST E83D (3): 519-529 MAR 2000}
}

@item{
  author = {Abellanas M, Hurtado F, Ramos PA}
  title = {Structural tolerance and Delaunay triangulation}
  where = {INFORM PROCESS LETT 71 (5-6): 221-227 SEP 30 1999}
}

@item{
  author = {Robins G, Robinson BL, Sethi BS}
  title = {On detecting spatial regularity in noisy images}
  where = {INFORM PROCESS LETT 69 (4): 189-195 FEB 26 1999}
}

@item{
  author = {Cai LZ, Keil JM}
  title = {Computing visibility information in an inaccurate simple polygon}
  where = {INT J COMPUT GEOM AP 7 (6): 515-537 DEC 1997}
}

@item{
  author = {Leung Y, Zhang JS, Xu JS}
  title = {Neural networks for convex hull computation}
  where = {IEEE T NEURAL NETWOR 8 (3): 601-611 MAY 1997 }
}

# ----------------------------------------------------------------------
# Lines in space: Combinatorics and algorithms
# Chazelle B, Edelsbrunner H, Guibas LJ, Sharir M, Stolfi J
# ALGORITHMICA 
# 15 (5): 428-447 MAY 1996
# ----------------------------------------------------------------------
  
@item{
  author = {Andreff N, Espiau B, Horaud R}
  title = {Visual servoing from lines}
  where = {INT J ROBOT RES 21 (8): 679-699 AUG 2002}
}

@item{
  author = {Theobald T}
  title = {An enumerative geometry framework or algorithmic line problems in R-3}
  where = {SIAM J COMPUT 31 (4): 1212-1228 MAY 8 2002}
}

@item{
  author = {Gomez F, Hurtado F, Sellares JA, et al.}
  title = {Nice perspective projections}
  where = {J VIS COMMUN IMAGE R 12 (4): 387-400 DEC 2001}
}

@item{
  author = {Eppstein D, Erickson J}
  title = {Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions}
  where = {DISCRETE COMPUT GEOM 22 (4): 569-592 DEC 1999}
}

@item{
  author = {Agarwal PK, Sharir M}
  title = {Efficient algorithms for geometric optimization}
  where = {ACM COMPUT SURV 30 (4): 412-458 DEC 1998}
}

@item{
  author = {Pottmann H, Peternell M, Ravani B}
  title = {An introduction to line geometry with applications}
  where = {COMPUT AIDED DESIGN 31 (1): 3-16 JAN 1999}
}

@item{
  author = {de Berg M, Everett H, Guibas LJ}
  title = {The union of moving polygonal pseudodiscs - Combinatorial bounds and applications}
  where = {COMP GEOM-THEOR APPL 11 (2): 69-81 OCT 1998}
}

@item{
  author = {Mohaban S, Sharir M}
  title = {Ray shooting amidst spheres in three dimensions and related problems}
  where = {SIAM J COMPUT 26 (3): 654-674 JUN 1997}
}

# ----------------------------------------------------------------------
# 2 METHODS FOR GENERATING FRACTALS
# SHALLIT J, STOLFI J
# COMPUTERS & GRAPHICS
# 13 (2): 185-191 1989
# ----------------------------------------------------------------------

@item{
  author = {von Haeseler F, Peitgen HO, Skordev G}
  title = {Self-similar structure of rescaled evolution sets of cellular automata I}
  where = {INT J BIFURCAT CHAOS 11 (4): 913-926 APR 2001}
}

@item{
  author = {Morcrette M}
  title = {Equivalence of descriptions of iterated figures}
  where = {THEOR COMPUT SCI 165 (2): 325-354 OCT 10 1996}
}

@item{
  author = {Allouche JP, Cateland E, Peitgen HO, et al.}
  title = {Automatic maps on a semiring with digits}
  where = {FRACTALS 3 (4): 663-677 DEC 1995}
}

@item{
  author = {Allouche JP, vonHaeseler F, Peitgen HO, et al.}
  title = {Linear cellular automata, finite automata and Pascal's triangle}
  where = {DISCRETE APPL MATH 66 (1): 1-22 APR 22 1996}
}

@item{
  author = {BARBE AM}
  title = {ON A CLASS OF FRACTAL MATRICES .3. LIMIT STRUCTURES AND HIERARCHICAL ITERATED FUNCTION SYSTEMS}
  where = {INT J BIFURCAT CHAOS 5 (4): 1119-1156 AUG 1995}
}

@item{
  author = {VONHAESELER FV, PEITGEN HO, SKORDEV G}
  title = {GLOBAL ANALYSIS OF SELF-SIMILARITY FEATURES OF CELLULAR-AUTOMATA - SELECTED EXAMPLES}
  where = {PHYSICA D 86 (1-2): 64-80 SEP 1 1995}
}

@item{
  author = {CULIK K, KARI J}
  title = {ON THE POWER OF L-SYSTEMS IN IMAGE GENERATION}
  where = {ACTA INFORM 31 (8): 761-773 NOV 1994}
}

@item{
  author = {CULIK K, DUBE S}
  title = {BALANCING ORDER AND CHAOS IN IMAGE GENERATION}
  where = {COMPUT GRAPH 17 (4): 465-486 JUL-AUG 1993}
}

@item{
  author = {CULIK K, KARI J}
  title = {IMAGE COMPRESSION USING WEIGHTED FINITE AUTOMATA}
  where = {COMPUT GRAPH 17 (3): 305-313 MAY-JUN 1993}
}

@item{
  author = {CULIK K, DUBE S}
  title = {L-SYSTEMS AND MUTUALLY RECURSIVE FUNCTION SYSTEMS}
  where = {ACTA INFORM 30 (3): 279-302 MAY 1993}
}

@item{
  author = {CULIK K, DUBE S}
  title = {RATIONAL AND AFFINE EXPRESSIONS FOR IMAGE DESCRIPTION}
  where = {DISCRETE APPL MATH 41 (2): 85-120 JAN 26 1993}
}

@item{
  author = {CULIK K, DUBE S}
  title = {BALANCING ORDER AND CHAOS IN IMAGE GENERATION}
  where = {LECT NOTES COMPUT SC 510: 600-614 1991}
}

# ----------------------------------------------------------------------
# Adaptive enumeration of implicit surfaces with affine arithmetic
# deFigueiredo LH, Stolfi J
# COMPUTER GRAPHICS FORUM
# 15 (5): 287-296 DEC 1996
# ----------------------------------------------------------------------

@item{
  author = {Lopes H, Oliveira JB, de Figueiredo LH}
  title = {Robust adaptive polygonal approximation of implicit curves}
  where = {COMPUT GRAPH-UK 26 (6): 841-852 DEC 2002}
}

@item{
  author = {Martin R, Shou HH, Voiculescu I, et al.}
  title = {Comparison of interval methods for plotting algebraic curves}
  where = {COMPUT AIDED GEOM D 19 (7): 553-587 JUL 2002}
}

@item{
  author = {Shou HH, Martin R, Voiculescu I, et al.}
  title = {Affine arithmetic in matrix form for polynomial evaluation and algebraic curve drawing}
  where = {PROG NAT SCI 12 (1): 77-81 JAN 2002}
}

@item{
  author = {Tanaka S, Morisaki A, Nakata S, et al.}
  title = {Sampling implicit surfaces based on stochastic differential equations with converging constraint}
  where = {COMPUT GRAPH-UK 24 (3): 419-431 JUN 2000}
}

@item{
  author = {Kolev L}
  title = {An interval method for global nonlinear analysis}
  where = {IEEE T CIRCUITS-I 47 (5): 675-683 MAY 2000}
}

@item{
  author = {Szabo Z, Vargyas M, Johnson AP}
  title = {Novel treatment of conformational flexibility using interval analysis}
  where = {J CHEM INF COMP SCI 40 (2): 339-346 MAR-APR 2000}
}

@item{
  author = {Tanaka S, Fukuda Y, Morisaki A, et al.}
  title = {Using Langevin-type stochastic-dynamical particles for sampling and rendering implicit surfaces}
  where = {IEICE T INF SYST E83D (2): 265-274 FEB 2000 }
}

  
# ----------------------------------------------------------------------
# OBJECTS THAT CANNOT BE TAKEN APART WITH 2 HANDS
# SNOEYINK J, STOLFI J
# DISCRETE & COMPUTATIONAL GEOMETRY
# 12 (3): 367-384 OCT 1994
# ----------------------------------------------------------------------
  
@item{
  author = {Schwarzer F, Schweikard A, Joskowicz L}
  title = {Efficient linear unboundedness testing: Algorithm and applications to translational assembly planning}
  where = {INT J ROBOT RES 19 (9): 817-834 SEP 2000}
}

@item{
  author = {Guibas LJ, Halperin D, Hirukawa H, et al.}
  title = {Polyhedral assembly partitioning using maximally covered cells in arrangements of convex polytopes}
  where = {INT J COMPUT GEOM AP 8 (2): 179-199 APR 1998}
}

@item{
  author = {SCHWEIKARD A, WILSON RH}
  title = {ASSEMBLY SEQUENCES FOR POLYHEDRAL}
  where = {ALGORITHMICA 13 (6): 539-552 JUN 1995}
}

# ----------------------------------------------------------------------
# ON COMPUTING ALL NORTHEAST NEAREST NEIGHBORS IN THE L1 METRIC
# GUIBAS LJ, STOLFI J
# INFORMATION PROCESSING LETTERS
# 17 (4): 219-223 1983
# ----------------------------------------------------------------------

@item{
  author = {Zhou H, Shenoy N, Nicholls W}
  title = {Efficient minimum spanning tree construction without Delaunay triangulation}
  where = {INFORM PROCESS LETT 81 (5): 271-276 MAR 16 2002}
}

@item{
  author = {Wee Y}
  title = {Constructing voronoi diagrams in the L-1 metric using the geographic nearest neighbors}
  where = {IEICE T FUND ELECTR E84A (7): 1755-1760 JUL 2001}
}

@item{
  author = {Mukhopadhyay A, Rao SV}
  title = {Output-sensitive algorithm for computing beta-skeletons}
  where = {COMPUTING 65 (3): 285-289 2000}
}

@item{
  author = {Zachariasen M}
  title = {Rectilinear full Steiner tree generation}
  where = {NETWORKS 33 (2): 125-143 MAR 1999}
}

@item{
  author = {ROBINS G, SALOWE JS}
  title = {LOW-DEGREE MINIMUM SPANNING-TREES}
  where = {DISCRETE COMPUT GEOM 14 (2): 151-165 SEP 1995}
}

@item{
  author = {JAROMCZYK JW, TOUSSAINT GT}
  title = {RELATIVE NEIGHBORHOOD GRAPHS AND THEIR RELATIVES}
  where = {P IEEE 80 (9): 1502-1517 SEP 1992}
}

@item{
  author = {RICHARDS DS, SALOWE JS}
  title = {STACKS, QUEUES, AND DEQUES WITH ORDER-STATISTIC OPERATIONS}
  where = {ACTA INFORM 29 (5): 395-414 SEP 1992}
}

@item{
  author = {WEE YC, CHAIKEN S, WILLARD DE}
  title = {ON THE ANGLE RESTRICTED NEAREST NEIGHBOR PROBLEM}
  where = {INFORM PROCESS LETT 34 (2): 71-76 MAR 16 1990}
}

@item{
  author = {KATAJAINEN J}
  title = {THE REGION APPROACH FOR COMPUTING RELATIVE NEIGHBORHOOD GRAPHS IN THE LP METRIC}
  where = {COMPUTING 40 (2): 147-161 1988}
}

@item{
  author = {KARLSSON RG, MUNRO JI}
  title = {PROXIMITY ON A GRID}
  where = {LECT NOTES COMPUT SC 182: 187-196 1985}
}

@item{
  author = {LEE DT, PREPARATA FP}
  title = {COMPUTATIONAL GEOMETRY - A SURVEY}
  where = {IEEE T COMPUT 33 (12): 1072-1101 1984}
}

@item{
  author = {JAROMCZYK JW, TOUSSAINT GT}
  title = {RELATIVE NEIGHBORHOOD GRAPHS AND THEIR RELATIVES}
  where = {P IEEE 80 (9): 1502-1517 SEP 1992}
}

# ----------------------------------------------------------------------
# SOLVING RELATED TWO-DIMENSIONAL AND 3-DIMENSIONAL LINEAR-PROGRAMMING PROBLEMS IN LOGARITHMIC TIME
# GUIBAS LJ, STOLFI J, CLARKSON KL
# THEORETICAL COMPUTER SCIENCE
# 49 (1): 81-84 1987
# ----------------------------------------------------------------------

@item{
  author = {Kim HS, Kim HO, Shin SY}
  title = {An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane}
  where = {COMPUT MATH APPL 36 (3): 55-61 AUG 1998}
}

@item{
  author = {Pujari AK, Nataraj A}
  title = {Linear algorithm to find the largest intriangles of a planar convex polygon}
  where = {KYBERNETES 25 (5): 53-& 1996}
}

@item{
  author = {MATOUSEK J}
  title = {LINEAR OPTIMIZATION QUERIES}
  where = {J ALGORITHM 14 (3): 432-448 MAY 1993}
}

# ----------------------------------------------------------------------  
# OPTIMAL POINT LOCATION IN A MONOTONE SUBDIVISION
# EDELSBRUNNER H, GUIBAS LJ, STOLFI J
# SIAM JOURNAL ON COMPUTING
# 15 (2): 317-340 MAY 1986
# ----------------------------------------------------------------------

@item{
  author = {Nandy SC, Das S, Goswami PP}
  title = {An efficient k nearest neighbors searching algorithm for a query line}
  where = {THEOR COMPUT SCI 299 (1-3): 273-288 APR 18 2003}
}

@item{
  author = {Agarwal PK, Procopiuc CM}
  title = {Approximation algorithms for projective clustering}
  where = {J ALGORITHM 46 (2): 115-139 FEB 2003}
}

@item{
  author = {Miller K, Ramaswami S, Rousseeuw P, et al.}
  title = {Efficient computation of location depth contours by methods of computational geometry}
  where = {STAT COMPUT 13 (2): 153-162 APR 2003}
}

@item{
  author = {Bose P, Wang QD}
  title = {Facility location constrained to a polygonal domain}
  where = {LECT NOTES COMPUT SC 2286: 153-164 2002}
}

@item{
  author = {Bose P, Morin P}
  title = {An improved algorithm for subdivision traversal without extra storage}
  where = {INT J COMPUT GEOM AP 12 (4): 297-308 AUG 2002}
}

@item{
  author = {Agarwal PK, Har-Peled S, Karia A}
  title = {Computing approximate shortest paths on convex polytopes}
  where = {ALGORITHMICA 33 (2): 227-242 JUN 2002}
}

@item{
  author = {Chen DZ, Daescu O, Klenk KS}
  title = {On geometric path query problems}
  where = {INT J COMPUT GEOM AP 11 (6): 617-645 DEC 2001}
}

@item{
  author = {Nandy SC}
  title = {An efficient k nearest neighbor searching algorithm for a query line}
  where = {LECT NOTES COMPUT SC 1858: 281-290 2000}
}

@item{
  author = {Bose P, Morin P}
  title = {An improved algorithm for subdivision traversal without extra storage}
  where = {LECT NOTES COMPUT SC 1969: 444-455 2001}
}

@item{
  author = {Efrat A, Itai A, Katz MJ}
  title = {Geometry helps in bottleneck matching and related problems}
  where = {ALGORITHMICA 31 (1): 1-28 SEP 2001}
}

@item{
  author = {Chen DZ, Xu JH}
  title = {An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model}
  where = {COMP GEOM-THEOR APPL 18 (3): 155-166 APR 2001}
}

@item{
  author = {Tamassia R, Vismara L}
  title = {A case study in algorithm engineering for geometric computing}
  where = {INT J COMPUT GEOM AP 11 (1): 15-70 FEB 2001}
}

@item{
  author = {Arya S, Cheng SW, Mount DM, et al.}
  title = {Efficient expected-case algorithms for planar point location}
  where = {LECT NOTES COMPUT SC 1851: 353-366 2000}
}

@item{
  author = {Agarwal PK, Aronov B, Har-Peled S, et al.}
  title = {Approximation algorithms for minimum-width annuli and shells}
  where = {DISCRETE COMPUT GEOM 24 (4): 687-705 DEC 2000}
}

@item{
  author = {Seidel R, Adamy U}
  title = {On the exact worst case query complexity of planar feint location}
  where = {J ALGORITHM 37 (1): 189-217 OCT 2000}
}

@item{
  author = {Chen DZ, Klenk KS, Tu HYT}
  title = {Shortest path queries among weighted obstacles in the rectilinear plane}
  where = {SIAM J COMPUT 29 (4): 1223-1246 MAR 6 2000}
}

@item{
  author = {D'Amore F, Giaccio R}
  title = {Intersection problems on segments under boundary updates with application to persistent lists}
  where = {INT J COMPUT GEOM AP 9 (6): 553-575 DEC 1999}
}

@item{
  author = {Hershberger J, Suri S}
  title = {An optimal algorithm for Euclidean shortest paths in the plane}
  where = {SIAM J COMPUT 28 (6): 2215-2256 AUG 17 1999}
}

@item{
  author = {Ghosh S}
  title = {On a fundamental physical principle underlying the point location algorithm in computer graphics}
  where = {IEEE T EDUC 42 (3): 200-204 AUG 1999}
}

@item{
  author = {Deng XT, Zhu BH}
  title = {A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors}
  where = {ALGORITHMICA 24 (3-4): 270-286 JUL-AUG 1999 }
}

@item{
  author = {Cai LZ, Xu YF, Zhu BH}
  title = {Computing the optimal bridge between two convex polygons}
  where = {INFORM PROCESS LETT 69 (3): 127-130 FEB 12 1999}
}

@item{
  author = {Liotta G, Preparata FP, Tamassia R}
  title = {Robust proximity queries: An illustration of degree-driven algorithm design}
  where = {SIAM J COMPUT 28 (3): 864-889 SEP 14 1998}
}

@item{
  author = {Garcia-Lopez J, Ramos PA, Snoeyink J}
  title = {Fitting a set of points by a circle}
  where = {DISCRETE COMPUT GEOM 20 (3): 389-402 OCT 1998}
}

@item{
  author = {Goodrich MT, Tamassia R}
  title = {Dynamic trees and dynamic point location}
  where = {SIAM J COMPUT 28 (2): 612-636 1998}
}

@item{
  author = {Devillers O, Golin MJ}
  title = {Dog bites postman: Point location in the moving Voronoi diagram and related problems}
  where = {INT J COMPUT GEOM AP 8 (3): 321-342 JUN 1998}
}

@item{
  author = {Hershberger J, Suri S}
  title = {Practical methods for approximating shortest paths on a convex polytope in R-3}
  where = {COMP GEOM-THEOR APPL 10 (1): 31-46 APR 1998}
}

@item{
  author = {Mirolo C}
  title = {Convex minimization on a grid and applications}
  where = {J ALGORITHM 26 (2): 209-237 FEB 1998}
}

@item{
  author = {Lee DT, Yang CD, Wong CK}
  title = {Finding rectilinear paths among obstacles in a two-layer interconnection model}
  where = {INT J COMPUT GEOM AP 7 (6): 581-598 DEC 1997}
}

@item{
  author = {Chan TM, Snoeyink J, Yap CK}
  title = {Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams}
  where = {DISCRETE COMPUT GEOM 18 (4): 433-454 DEC 1997}
}

@item{
  author = {Christofides N, Badra HO, Sharaiha YM}
  title = {Data structures for topological and geometric operations on networks}
  where = {ANN OPER RES 71: 259-289 1997}
}

@item{
  author = {Guibas LJ, Motwani R, Raghavan P}
  title = {The robot localization problem}
  where = {SIAM J COMPUT 26 (4): 1120-1138 AUG 1997}
}

@item{
  author = {deBerg M, vanKreveld M}
  title = {Trekking in the Alps without freezing or getting tired}
  where = {ALGORITHMICA 18 (3): 306-323 JUL 1997}
}

@item{
  author = {Kolingerova I}
  title = {Convex polyhedron-line intersection detection using dual representation}
  where = {VISUAL COMPUT 13 (1): 42-49 1997}
}

@item{
  author = {Overmars MH, vanderStappen AF}
  title = {Range searching and point location among fat objects}
  where = {J ALGORITHM 21 (3): 629-656 NOV 1996}
}

@item{
  author = {Pellegrini M}
  title = {On point location and motion planning among simplices}
  where = {SIAM J COMPUT 25 (5): 1061-1081 OCT 1996}
}

@item{
  author = {Efrat A, Sharir M}
  title = {A near-linear algorithm for the planar segment-center problem}
  where = {DISCRETE COMPUT GEOM 16 (3): 239-257 OCT 1996}
}

@item{
  author = {Pellegrini M}
  title = {Repetitive hidden surface removal for polyhedra}
  where = {J ALGORITHM 21 (1): 80-101 JUL 1996}
}

@item{
  author = {Schuierer S}
  title = {An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon}
  where = {INT J COMPUT GEOM AP 6 (2): 205-225 JUN 1996}
}

@item{
  author = {Friedman J, Hershberger J, Snoeyink J}
  title = {Efficiently planning compliant motion in the plane}
  where = {SIAM J COMPUT 25 (3): 562-599 JUN 1996}
}

@item{
  author = {Chen DZ, Klenk KS}
  title = {Rectilinear short path queries among rectangular obstacles}
  where = {INFORM PROCESS LETT 57 (6): 313-319 MAR 25 1996}
}

@item{
  author = {Chiang YJ, Preparata FP, Tamassia R}
  title = {A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps}
  where = {SIAM J COMPUT 25 (1): 207-233 FEB 1996}
}

@item{
  author = {Chepoi V}
  title = {A multifacility location problem on median spaces}
  where = {DISCRETE APPL MATH 64 (1): 1-29 JAN 4 1996}
}

@item{
  author = {Tamassia R, Vitter JS}
  title = {Optimal cooperative search in fractional cascaded data structures}
  where = {ALGORITHMICA 15 (2): 154-171 FEB 1996}
}

@item{
  author = {McAllister M, Kirkpatrick D, Snoeyink J}
  title = {A compact piecewise-linear Voronoi diagram for convex sites in the plane}
  where = {DISCRETE COMPUT GEOM 15 (1): 73-105 JAN 1996}
}

@item{
  author = {SWANSON K, LEE DT, WU VL}
  title = {AN OPTIMAL ALGORITHM FOR ROUNDNESS DETERMINATION ON CONVEX POLYGONS}
  where = {COMP GEOM-THEOR APPL 5 (4): 225-235 NOV 1995}
}

@item{
  author = {ERWIG M}
  title = {ENCODING SHORTEST PATHS IN SPATIAL NETWORKS}
  where = {NETWORKS 26 (4): 291-303 DEC 1995}
}

@item{
  author = {COHEN RF, DIBATTISTA G, TAMASSIA R, et al.}
  title = {DYNAMIC GRAPH DRAWINGS - TREES, SERIES-PARALLEL DIGRAPHS, AND PLANAR ST-DIGRAPHS}
  where = {SIAM J COMPUT 24 (5): 970-1001 OCT 1995}
}

@item{
  author = {BECKER B, DRECHSLER R, MOLITOR P}
  title = {ON THE GENERATION OF AREA-TIME OPTIMAL TESTABLE ADDERS}
  where = {IEEE T COMPUT AID D 14 (9): 1049-1066 SEP 1995}
}

@item{
  author = {AMATO NM, PREPARATA FP}
  title = {A TIME-OPTIMAL PARALLEL ALGORITHM FOR 3-DIMENSIONAL CONVEX HULLS}
  where = {ALGORITHMICA 14 (2): 169-182 AUG 1995}
}

@item{
  author = {HERSHBERGER J, SURI S}
  title = {A PEDESTRIAN APPROACH TO RAY SHOOTING - SHOOT A RAY, TAKE A WALK}
  where = {J ALGORITHM 18 (3): 403-431 MAY 1995}
}

@item{
  author = {LOPEZ MA, THURIMELLA R}
  title = {OH COMPUTING CONNECTED COMPONENTS OF LINE SEGMENTS}
  where = {IEEE T COMPUT 44 (4): 597-601 APR 1995}
}

@item{
  author = {ATKINSON DS, VAIDYA PM}
  title = {USING GEOMETRY TO SOLVE THE TRANSPORTATION PROBLEM IN THE PLANE}
  where = {ALGORITHMICA 13 (5): 442-461 MAY 1995}
}

@item{
  author = {HEFFERNAN PJ, MITCHELL JSB}
  title = {AN OPTIMAL ALGORITHM FOR COMPUTING VISIBILITY IN THE PLANE}
  where = {SIAM J COMPUT 24 (1): 184-201 FEB 1995}
}

@item{
  author = {CHEPOI V, DRAGAN F}
  title = {COMPUTING A MEDIAN POINT OF A SIMPLE RECTILINEAR POLYGON}
  where = {INFORM PROCESS LETT 49 (6): 281-285 MAR 22 1994}
}

@item{
  author = {EFRAT A, SHARIR M, ZIV A}
  title = {COMPUTING THE SMALLEST KAPPA-ENCLOSING CIRCLE AND RELATED PROBLEMS}
  where = {COMP GEOM-THEOR APPL 4 (3): 119-136 JUL 1994}
}

@item{
  author = {SHARIR M, TOLEDO S}
  title = {EXTREMAL POLYGON CONTAINMENT PROBLEMS}
  where = {COMP GEOM-THEOR APPL 4 (2): 99-118 JUN 1994}
}

@item{
  author = {CHAZELLE B, EDELSBRUNNER H, GRIGNI M, et al.}
  title = {RAY SHOOTING IN POLYGONS USING GEODESIC TRIANGULATIONS}
  where = {ALGORITHMICA 12 (1): 54-68 JUL 1994}
}

@item{
  author = {CHAZELLE B, EDELSBRUNNER H, GUIBAS LJ, et al.}
  title = {ALGORITHMS FOR BICHROMATIC LINE-SEGMENT PROBLEMS AND POLYHEDRAL TERRAINS}
  where = {ALGORITHMICA 11 (2): 116-132 FEB 1994}
}

@item{
  author = {AGARWAL PK, PELLEGRINI M, SHARIR M}
  title = {COUNTING CIRCULAR-ARC INTERSECTIONS}
  where = {SIAM J COMPUT 22 (4): 778-793 AUG 1993}
}

@item{
  author = {CHAZELLE B, EDELSBRUNNER H, GUIBAS L, et al.}
  title = {DIAMETER, WIDTH, CLOSEST LINE PAIR, AND PARAMETRIC SEARCHING}
  where = {DISCRETE COMPUT GEOM 10 (2): 183-196 1993}
}

@item{
  author = {AURENHAMMER F, STOCKL G, WELZL E}
  title = {THE POST-OFFICE PROBLEM FOR FUZZY POINT SETS}
  where = {LECT NOTES COMPUT SC 553: 1-11 1991}
}

@item{
  author = {AGARWAL PK, VANKREVELD M}
  title = {IMPLICIT POINT LOCATION IN ARRANGEMENTS OF LINE SEGMENTS, WITH AN APPLICATION TO MOTION PLANNING}
  where = {LECT NOTES COMPUT SC 652: 80-91 1992}
}

@item{
  author = {FLEISCHER R, FRIES O, MEHLHORN K, et al.}
  title = {SELECTED TOPICS FROM COMPUTATIONAL GEOMETRY, DATA-STRUCTURES AND MOTION PLANNING}
  where = {LECT NOTES COMPUT SC 594: 25-43 1992}
}

@item{
  author = {NILSSON BJ, OTTMANN T, SCHUIERER S, et al.}
  title = {RESTRICTED ORIENTATION COMPUTATIONAL GEOMETRY}
  where = {LECT NOTES COMPUT SC 594: 148-185 1992}
}

@item{
  author = {AURENHAMMER F, STOCKL G}
  title = {SEARCHING FOR SEGMENTS WITH LARGEST RELATIVE OVERLAP}
  where = {LECT NOTES CONTR INF 180: 77-84 1992}
}

@item{
  author = {DOBKIN D, HERSHBERGER J, KIRKPATRICK D, et al.}
  title = {COMPUTING THE INTERSECTION-DEPTH OF POLYHEDRA}
  where = {ALGORITHMICA 9 (6): 518-533 JUN 1993}
}

@item{
  author = {AGARWAL PK, ARONOV B, SHARIR M, et al.}
  title = {SELECTING DISTANCES IN THE PLANE}
  where = {ALGORITHMICA 9 (5): 495-514 MAY 1993}
}

@item{
  author = {AGARWAL PK, SHARIR M}
  title = {CIRCLE SHOOTING IN A SIMPLE POLYGON}
  where = {J ALGORITHM 14 (1): 69-87 JAN 1993}
}

@item{
  author = {ALT H, FLEISCHER R, KAUFMANN M, et al.}
  title = {APPROXIMATE MOTION PLANNING AND THE COMPLEXITY OF THE BOUNDARY OF THE UNION OF SIMPLE GEOMETRIC-FIGURES}
  where = {ALGORITHMICA 8 (5-6): 391-406 1992}
}

@item{
  author = {MITCHELL JSB, ROTE G, WOEGINGER G}
  title = {MINIMUM-LINK PATHS AMONG OBSTACLES IN THE PLANE}
  where = {ALGORITHMICA 8 (5-6): 431-459 1992 }
}

@item{
  author = {CHIANG YJ, TAMASSIA R}
  title = {DYNAMIC ALGORITHMS IN COMPUTATIONAL GEOMETRY}
  where = {P IEEE 80 (9): 1412-1434 SEP 1992}
}

@item{
  author = {SIU WC, JANARDAN R}
  title = {NEW RESULTS ON DYNAMIC PLANAR POINT LOCATION}
  where = {SIAM J COMPUT 21 (5): 972-999 OCT 1992}
}

@item{
  author = {PREPARATA FP, VITTER JS, YVINEC M}
  title = {OUTPUT-SENSITIVE GENERATION OF THE PERSPECTIVE VIEW OF ISOTHETIC PARALLELEPIPEDS}
  where = {ALGORITHMICA 8 (4): 257-283 1992}
}

@item{
  author = {MITRA P}
  title = {ANSWERING GABRIEL NEIGHBOR QUERIES}
  where = {PATTERN RECOGN LETT 13 (8): 557-560 AUG 1992}
}

@item{
  author = {MELISSARATOS EA, SOUVAINE DL}
  title = {SHORTEST PATHS HELP SOLVE GEOMETRIC OPTIMIZATION PROBLEMS IN PLANAR REGIONS}
  where = {SIAM J COMPUT 21 (4): 601-638 AUG 1992}
}

@item{
  author = {VANKREVELD M, OVERMARS M, AGARWAL PK}
  title = {INTERSECTION QUERIES IN SETS OF DISKS}
  where = {BIT 32 (2): 268-279 1992}
}

@item{
  author = {SCHWARTZ JT, SHARIR M}
  title = {FINDING EFFECTIVE FORCE TARGETS FOR 2-DIMENSIONAL, MULTIFINGER FRICTIONAL GRIPS}
  where = {ALGORITHMICA 8 (1): 1-20 1992}
}

@item{
  author = {MITCHELL JSB}
  title = {L1 SHORTEST PATHS AMONG POLYGONAL OBSTACLES IN THE PLANE}
  where = {ALGORITHMICA 8 (1): 55-88 1992}
}

@item{
  author = {AGARWAL PK}
  title = {RAY SHOOTING AND OTHER APPLICATIONS OF SPANNING-TREES WITH LOW STABBING NUMBER}
  where = {SIAM J COMPUT 21 (3): 540-570 JUN 1992}
}

@item{
  author = {BONAPACE CR, LO CY}
  title = {AN O(NLOGM) ALGORITHM FOR VLSI DESIGN RULE CHECKING}
  where = {IEEE T COMPUT AID D 11 (6): 753-758 JUN 1992}
}

@item{
  author = {KIRKPATRICK DG, KLAWE MM, TARJAN RE}
  title = {POLYGON TRIANGULATION IN O(N-LOG LOG-N) TIME WITH SIMPLE DATA-STRUCTURES}
  where = {DISCRETE COMPUT GEOM 7 (4): 329-346 1992}
}

@item{
  author = {GUIBAS LJ, KNUTH DE, SHARIR M}
  title = {RANDOMIZED INCREMENTAL CONSTRUCTION OF DELAUNAY AND VORONOI DIAGRAMS}
  where = {ALGORITHMICA 7 (4): 381-413 1992}
}

@item{
  author = {AURENHAMMER F, STOCKL G}
  title = {SEARCHING FOR SEGMENTS WITH LARGEST RELATIVE OVERLAP}
  where = {INFORM PROCESS LETT 41 (2): 103-108 FEB 14 1992}
}

@item{
  author = {CHEN YA, LIN YL, CHANG LW}
  title = {A SYSTOLIC ALGORITHM FOR THE KAPPA-NEAREST NEIGHBORS PROBLEM}
  where = {IEEE T COMPUT 41 (1): 103-108 JAN 1992}
}

@item{
  author = {AURENHAMMER F}
  title = {VORONOI DIAGRAMS - A SURVEY OF A FUNDAMENTAL GEOMETRIC DATA STRUCTURE}
  where = {COMPUT SURV 23 (3): 345-405 SEP 1991}
}

@item{
  author = {HO JM, LEE DT, CHANG CH, et al.}
  title = {MINIMUM DIAMETER SPANNING-TREES AND RELATED PROBLEMS}
  where = {SIAM J COMPUT 20 (5): 987-997 OCT 1991}
}

@item{
  author = {AGARWAL PK, EDELSBRUNNER H, SCHWARZKOPF O, et al.}
  title = {EUCLIDEAN MINIMUM SPANNING-TREES AND BICHROMATIC CLOSEST PAIRS}
  where = {DISCRETE COMPUT GEOM 6 (5): 407-422 1991}
}

@item{
  author = {CHAZELLE B}
  title = {TRIANGULATING A SIMPLE POLYGON IN LINEAR TIME}
  where = {DISCRETE COMPUT GEOM 6 (5): 485-524 1991}
}

@item{
  author = {CHAZELLE B, EDELSBRUNNER H, GRIGNI M, et al.}
  title = {RAY SHOOTING IN POLYGONS USING GEODESIC TRIANGULATIONS}
  where = {LECT NOTES COMPUT SC 510: 661-673 1991}
}

@item{
  author = {CHAZELLE B, EDELSBRUNNER H, GUIBAS LJ, et al.}
  title = {A SINGLY EXPONENTIAL STRATIFICATION SCHEME FOR REAL SEMIALGEBRAIC VARIETIES AND ITS APPLICATIONS}
  where = {THEOR COMPUT SCI 84 (1): 77-105 JUL 22 1991}
}

@item{
  author = {TAMASSIA R, VITTER JS}
  title = {PARALLEL TRANSITIVE CLOSURE AND POINT LOCATION IN PLANAR STRUCTURES}
  where = {SIAM J COMPUT 20 (4): 708-725 AUG 1991}
}

@item{
  author = {DOBKIN D, SURI S}
  title = {MAINTENANCE OF GEOMETRIC EXTREMA}
  where = {J ACM 38 (2): 275-298 APR 1991}
}

@item{
  author = {GUNTHER O, WONG E}
  title = {A DUAL APPROACH TO DETECT POLYHEDRAL INTERSECTIONS IN ARBITRARY DIMENSIONS}
  where = {BIT 31 (1): 2-14 1991}
}

@item{
  author = {SU TH, CHANG RC}
  title = {COMPUTING THE K-RELATIVE NEIGHBORHOOD GRAPHS IN EUCLIDEAN PLANE}
  where = {PATTERN RECOGN 24 (3): 231-239 1991}
}

@item{
  author = {EDELSBRUNNER H, SHI WP}
  title = {AN 0(N LOG2 H) TIME ALGORITHM FOR THE 3-DIMENSIONAL CONVEX-HULL PROBLEM}
  where = {SIAM J COMPUT 20 (2): 259-269 APR 1991}
}

@item{
  author = {MULMULEY K}
  title = {A FAST PLANAR PARTITION ALGORITHM .2.}
  where = {J ACM 38 (1): 74-103 JAN 1991}
}

@item{
  author = {TAMASSIA R}
  title = {AN INCREMENTAL RECONSTRUCTION METHOD FOR DYNAMIC PLANAR POINT LOCATION}
  where = {INFORM PROCESS LETT 37 (2): 79-83 JAN 31 1991}
}

@item{
  author = {ROHNERT H}
  title = {MOVING A DISK BETWEEN POLYGONS}
  where = {ALGORITHMICA 6 (2): 182-191 1991}
}

@item{
  author = {CHAZELLE B, SHARIR M}
  title = {AN ALGORITHM FOR GENERALIZED POINT LOCATION AND ITS APPLICATIONS}
  where = {J SYMB COMPUT 10 (3-4): 281-309 SEP-OCT 1990}
}

@item{
  author = {AVIS D, IMAI H}
  title = {LOCATING A ROBOT WITH ANGLE MEASUREMENTS}
  where = {J SYMB COMPUT 10 (3-4): 311-326 SEP-OCT 1990}
}

@item{
  author = {AGARWAL PK}
  title = {PARTITIONING ARRANGEMENTS OF LINES .2. APPLICATIONS}
  where = {DISCRETE COMPUT GEOM 5 (6): 533-573 1990}
}

@item{
  author = {CHAZELLE B, PALIOS L}
  title = {TRIANGULATING A NONCONVEX POLYTOPE}
  where = {DISCRETE COMPUT GEOM 5 (5): 505-526 1990}
}

@item{
  author = {DOBKIN D, HERSHBERGER J, KIRKPATRICK D, et al.}
  title = {IMPLICITLY SEARCHING CONVOLUTIONS AND COMPUTING DEPTH OF COLLISION}
  where = {LECT NOTES COMPUT SC 450: 165-180 1990}
}

@item{
  author = {PREPARATA FP, VITTER JS, YVINEC M}
  title = {OUTPUT-SENSITIVE GENERATION OF THE PERSPECTIVE VIEW OF ISOTHETIC PARALLELEPIPEDS}
  where = {LECT NOTES COMPUT SC 447: 71-84 1990}
}

@item{
  author = {FRIEDMAN J, HERSHBERGER J, SNOEYINK J}
  title = {INPUT-SENSITIVE COMPLIANT MOTION IN THE PLANE}
  where = {LECT NOTES COMPUT SC 447: 225-237 1990}
}

@item{
  author = {AGARWAL PK, ARONOV B, OROURKE J, et al.}
  title = {STAR UNFOLDING OF A POLYTOPE WITH APPLICATIONS}
  where = {LECT NOTES COMPUT SC 447: 251-263 1990}
}

@item{
  author = {VANKREVELD M, OVERMARS M, AGARWAL PK}
  title = {INTERSECTION QUERIES IN SETS OF DISKS}
  where = {LECT NOTES COMPUT SC 447: 393-403 1990}
}

@item{
  author = {GUIBAS LJ, KNUTH DE, SHARIR M}
  title = {RANDOMIZED INCREMENTAL CONSTRUCTION OF DELAUNAY AND VORONOI DIAGRAMS}
  where = {LECT NOTES COMPUT SC 443: 414-431 1990}
}

@item{
  author = {TAMASSIA R, PREPARATA FP}
  title = {DYNAMIC MAINTENANCE OF PLANAR DIGRAPHS, WITH APPLICATIONS}
  where = {ALGORITHMICA 5 (4): 509-527 1990}
}

@item{
  author = {PREPARATA FP, TAMASSIA R}
  title = {DYNAMIC PLANAR POINT LOCATION WITH OPTIMAL QUERY TIME}
  where = {THEOR COMPUT SCI 74 (1): 95-114 JUL 30 1990}
}

@item{
  author = {PREPARATA FP, VITTER JS, YVINEC M}
  title = {COMPUTATION OF THE AXIAL VIEW OF A SET OF ISOTHETIC PARALLELEPIPEDS}
  where = {ACM T GRAPHIC 9 (3): 278-300 JUL 1990}
}

@item{
  author = {EDELSBRUNNER H, GUIBAS LJ, SHARIR M}
  title = {THE COMPLEXITY AND CONSTRUCTION OF MANY FACES IN ARRANGEMENTS OF LINES AND OF SEGMENTS}
  where = {DISCRETE COMPUT GEOM 5 (2): 161-196 1990}
}

@item{
  author = {SURI S}
  title = {ON SOME LINK DISTANCE PROBLEMS IN A SIMPLE POLYGON}
  where = {IEEE T ROBOTIC AUTOM 6 (1): 108-113 FEB 1990}
}

@item{
  author = {MEHLHORN K, NAHER S}
  title = {DYNAMIC FRACTIONAL CASCADING}
  where = {ALGORITHMICA 5 (2): 215-241 1990}
}

@item{
  author = {BLANKENAGEL G, GUTING RH}
  title = {INTERNAL AND EXTERNAL ALGORITHMS FOR THE POINTS-IN-REGIONS PROBLEM - THE INSIDE JOIN OF GEO-RELATIONAL ALGEBRA}
  where = {ALGORITHMICA 5 (2): 251-276 1990}
}

@item{
  author = {SAMET H}
  title = {HIERARCHICAL REPRESENTATIONS OF COLLECTIONS OF SMALL RECTANGLES}
  where = {COMPUT SURV 20 (4): 271-309 DEC 1988}
}

@item{
  author = {EDELSBRUNNER H, PREPARATA FP, WEST DB}
  title = {TETRAHEDRIZING POINT SETS IN 3 DIMENSIONS}
  where = {LECT NOTES COMPUT SC 358: 315-331 1989}
}

@item{
  author = {CHAZELLE B, GUIBAS LJ}
  title = {VISIBILITY AND INTERSECTION PROBLEMS IN PLANE GEOMETRY}
  where = {DISCRETE COMPUT GEOM 4 (6): 551-581 1989}
}

@item{
  author = {GUIBAS LJ, HERSHBERGER J}
  title = {OPTIMAL SHORTEST-PATH QUERIES IN A SIMPLE POLYGON}
  where = {J COMPUT SYST SCI 39 (2): 126-152 OCT 1989}
}

@item{
  author = {EDELSBRUNNER H, GUIBAS L, HERSHBERGER J, et al.}
  title = {IMPLICITLY REPRESENTING ARRANGEMENTS OF LINES OR SEGMENTS}
  where = {DISCRETE COMPUT GEOM 4 (5): 433-466 1989}
}

@item{
  author = {EDELSBRUNNER H, ROTE G, WELZL E}
  title = {TESTING THE NECKLACE CONDITION FOR SHORTEST TOURS AND OPTIMAL FACTORS IN THE PLANE}
  where = {THEOR COMPUT SCI 66 (2): 157-180 AUG 20 1989}
}

@item{
  author = {CHAZELLE B, EDELSBRUNNER H, GUIBAS LJ, et al.}
  title = {A SINGLY-EXPONENTIAL STRATIFICATION SCHEME FOR REAL SEMI-ALGEBRAIC VARIETIES AND ITS APPLICATIONS}
  where = {LECT NOTES COMPUT SC 372: 179-193 1989}
}

@item{
  author = {PREPARATA FP, TAMASSIA R}
  title = {FULLY DYNAMIC POINT LOCATION IN A MONOTONE SUBDIVISION}
  where = {SIAM J COMPUT 18 (4): 811-830 AUG 1989}
}

@item{
  author = {SHARIR M}
  title = {THE SHORTEST WATCHTOWER AND RELATED PROBLEMS FOR POLYHEDRAL TERRAINS}
  where = {INFORM PROCESS LETT 29 (5): 265-270 NOV 24 1988}
}

@item{
  author = {PREPARATA FP, TAMASSIA R}
  title = {DYNAMIC PLANAR POINT LOCATION WITH OPTIMAL QUERY TIME}
  where = {LECT NOTES COMPUT SC 349: 84-95 1989}
}

@item{
  author = {COLE R, SHARIR M}
  title = {VISIBILITY PROBLEMS FOR POLYHEDRAL TERRAINS}
  where = {J SYMB COMPUT 7 (1): 11-30 JAN 1989}
}

@item{
  author = {EDELSBRUNNER H, GUIBAS LJ}
  title = {TOPOLOGICALLY SWEEPING AN ARRANGEMENT}
  where = {J COMPUT SYST SCI 38 (1): 165-194 FEB 1989}
}

@item{
  author = {EDAHIRO M, TANAKA K, HOSHINO T, et al.}
  title = {A BUCKETING ALGORITHM FOR THE ORTHOGONAL SEGMENT INTERSECTION SEARCH PROBLEM AND ITS PRACTICAL EFFICIENCY}
  where = {ALGORITHMICA 4 (1): 61-76 1989}
}

@item{
  author = {PREPARATA FP}
  title = {PLANAR POINT LOCATION REVISITED (A GUIDED TOUR OF A DECADE OF RESEARCH)}
  where = {LECT NOTES COMPUT SC 338: 1-17 1988}
}

@item{
  author = {GUNTHER O}
  title = {EFFICIENT STRUCTURES FOR GEOMETRIC DATA MANAGEMENT}
  where = {LECT NOTES COMPUT SC 337: 1-& 1988}
}

@item{
  author = {DEREZENDE PJ, LEE DT, WU YF}
  title = {RECTILINEAR SHORTEST PATHS IN THE PRESENCE OF RECTANGULAR BARRIERS}
  where = {DISCRETE COMPUT GEOM 4 (1): 41-53 1989}
}

@item{
  author = {OROURKE J}
  title = {COMPUTATIONAL GEOMETRY}
  where = {ANNU REV COMPUT SCI 3: 389-411 1988}
}

@item{
  author = {TAMASSIA R}
  title = {A DYNAMIC DATA STRUCTURE FOR PLANAR GRAPH EMBEDDING}
  where = {LECT NOTES COMPUT SC 317: 576-590 1988}
}

@item{
  author = {CLARKSON KL}
  title = {A RANDOMIZED ALGORITHM FOR CLOSEST-POINT QUERIES}
  where = {SIAM J COMPUT 17 (4): 830-847 AUG 1988}
}

@item{
  author = {KIRKPATRICK DG}
  title = {ESTABLISHING ORDER IN PLANAR SUBDIVISIONS}
  where = {DISCRETE COMPUT GEOM 3 (3): 267-280 1988}
}

@item{
  author = {TARJAN RE, VANWYK CJ}
  title = {AN O(N-LOG LOG-N)-TIME ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON}
  where = {SIAM J COMPUT 17 (1): 143-178 FEB 1988}
}

@item{
  author = {WIDMAYER P, WU YF, WONG CK}
  title = {ON SOME DISTANCE PROBLEMS IN FIXED ORIENTATIONS}
  where = {SIAM J COMPUT 16 (4): 728-746 AUG 1987}
}

@item{
  author = {AKMAN V}
  title = {UNOBSTRUCTED SHORTEST PATHS IN POLYHEDRAL ENVIRONMENTS}
  where = {LECT NOTES COMPUT SC 251: U1-& 1987}
}

@item{
  author = {ROSENFELD A}
  title = {PICTURE-PROCESSING - 1986}
  where = {COMPUT VISION GRAPH 38 (2): 147-225 MAY 1987}
}

@item{
  author = {CHAZELLE B, EDELSBRUNNER H}
  title = {LINEAR-SPACE DATA-STRUCTURES FOR 2 TYPES OF RANGE SEARCH}
  where = {DISCRETE COMPUT GEOM 2 (2): 113-126 1987}
}

@item{
  author = {MOUNT DM}
  title = {STORING THE SUBDIVISION OF A POLYHEDRAL SURFACE}
  where = {DISCRETE COMPUT GEOM 2 (2): 153-174 1987}
}

@item{
  author = {COLE R, SHARIR M, YAP CK}
  title = {ON K-HULLS AND RELATED PROBLEMS}
  where = {SIAM J COMPUT 16 (1): 61-77 FEB 1987}
}

@item{
  author = {WU YF, WIDMAYER P, SCHLAG MDF, et al.}
  title = {RECTILINEAR SHORTEST PATHS AND MINIMUM SPANNING-TREES IN THE PRESENCE OF RECTILINEAR OBSTACLES}
  where = {IEEE T COMPUT 36 (3): 321-331 MAR 1987}
}

@item{
  author = {CHAZELLE B}
  title = {FILTERING SEARCH - A NEW APPROACH TO QUERY-ANSWERING}
  where = {SIAM J COMPUT 15 (3): 703-724 AUG 1986}
}

@item{
  author = {EDELSBRUNNER H, OROURKE J, SEIDEL R}
  title = {CONSTRUCTING ARRANGEMENTS OF LINES AND HYPERPLANES WITH APPLICATIONS}
  where = {SIAM J COMPUT 15 (2): 341-363 MAY 1986}
}

@item{
  author = {DeBerg M, VanKreveld M, VanOostrum R, et al.}
  title = {Simple traversal of a subdivision without extra storage}
  where = {INT J GEOGR INF SCI 11 (4): 359-373 JUN 1997}
}

# ----------------------------------------------------------------------
# PRIMITIVES FOR THE MANIPULATION OF GENERAL SUBDIVISIONS AND THE COMPUTATION OF VORONOI DIAGRAMS
# GUIBAS L, STOLFI J
# ACM TRANSACTIONS ON GRAPHICS
# 4 (2): 74-123 1985  
# ----------------------------------------------------------------------

@item{
  author = {Timoshevskii A, Yeremin V, Kalkuta S}
  title = {New method for ecological monitoring based on the method of self-organising mathematical models}
  where = {ECOL MODEL 162 (1-2): 1-13 APR 1 2003}
}

@item{
  author = {Park JH, Park HW}
  title = {Fast view interpolation of stereo images using image gradient and disparity triangulation}
  where = {SIGNAL PROCESS-IMAGE 18 (5): 401-416 MAY 2003}
}

@item{
  author = {Brouns G, De Wulf A, Constales D}
  title = {Delaunay triangulation algorithms useful for multibeam echosounding}
  where = {J SURV ENG-ASCE 129 (2): 79-84 MAY 2003}
}

@item{
  author = {Secchi S, Simoni L}
  title = {An improved procedure for 2D unstructured Delaunay mesh generation}
  where = {ADV ENG SOFTW 34 (4): 217-234 APR 2003}
}

@item{
  author = {Hurtado F, Liotta G, Meijer H}
  title = {Optimal and suboptimal robust algorithms for proximity graphs}
  where = {COMP GEOM-THEOR APPL 25 (1-2): 35-49 MAY 2003}
}

@item{
  author = {Kettner L, Rossignac J, Snoeyink J}
  title = {The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra}
  where = {COMP GEOM-THEOR APPL 25 (1-2): 97-116 MAY 2003}
}

@item{
  author = {Tse ROC, Gold C}
  title = {TIN meets CAD - Extending the TIN concept in GIS}
  where = {LECT NOTES COMPUT SC 2331: 135-143 2002}
}

@item{
  author = {Zee K, Rinard M}
  title = {Write barrier removal by static analysis}
  where = {ACM SIGPLAN NOTICES 37 (11): 191-210 NOV 2002}
}

@item{
  author = {Taubin G}
  title = {Dual mesh resampling}
  where = {GRAPH MODELS 64 (2): 94-113 MAR 2002}
}

@item{
  author = {Chen CW, Zebker HA}
  title = {Phase unwrapping for large SAR interferograms: Statistical segmentation and generalized network models}
  where = {IEEE T GEOSCI REMOTE 40 (8): 1709-1719 AUG 2002}
}

@item{
  author = {Taubin G}
  title = {Detecting and reconstructing subdivision connectivity}
  where = {VISUAL COMPUT 18 (5-6): 357-367 AUG 2002}
}

@item{
  author = {Bose P, Morin P}
  title = {An improved algorithm for subdivision traversal without extra storage}
  where = {INT J COMPUT GEOM AP 12 (4): 297-308 AUG 2002}
}

@item{
  author = {Schmidt KE, Stephan M, Singer W, et al.}
  title = {Spatial analysis of ocular dominance patterns in monocularly deprived cats}
  where = {CEREB CORTEX 12 (8): 783-796 AUG 2002}
}

@item{
  author = {Sisias G, Phillips R, Dobson CA, et al.}
  title = {Algorithms for accurate rapid prototyping replication of cancellous bone voxel maps}
  where = {RAPID PROTOTYPING J 8 (1): 6-24 2002}
}

@item{
  author = {Ferrez JA, Liebling TM}
  title = {Dynamic triangulations for efficient detection of collisions between spheres with applications in granular media simulations}
  where = {PHILOS MAG B 82 (8): 905-929 MAY 20 2002}
}

@item{
  author = {Mattiussi C}
  title = {A reference discretization strategy for the numerical solution of physical field problems}
  where = {ADV IMAG ELECT PHYS 121: 143-279 2002}
}

@item{
  author = {Ahn HK, de Berg M, Bose P, et al.}
  title = {Separating an object from its cast}
  where = {COMPUT AIDED DESIGN 34 (8): 547-559 JUL 2002}
}

@item{
  author = {Boissonnat JD, Devillers O, Pion S, et al.}
  title = {Triangulations in CGAL}
  where = {COMP GEOM-THEOR APPL 22 (1-3): 5-19 MAY 2002}
}

@item{
  author = {Shewchuk JR}
  title = {Delaunay refinement algorithms for triangular mesh generation}
  where = {COMP GEOM-THEOR APPL 22 (1-3): 21-74 MAY 2002}
}

@item{
  author = {Vigo M, Pla N, Cotrina J}
  title = {Regular triangulations of dynamic sets of points}
  where = {COMPUT AIDED GEOM D 19 (2): 127-149 FEB 2002}
}

@item{
  author = {Wang BT, Zhou XG}
  title = {Model of random polygon particles for concrete and mesh automatic subdivision}
  where = {J WUHAN UNIV TECHNOL 16 (4): 36-40 DEC 2001}
}

@item{
  author = {Spriggs MJ, Keil JM}
  title = {A new bound for map labeling with uniform circle pairs}
  where = {INFORM PROCESS LETT 81 (1): 47-53 JAN 16 2002}
}

@item{
  author = {Bose P, Morin P}
  title = {An improved algorithm for subdivision traversal without extra storage}
  where = {LECT NOTES COMPUT SC 1969: 444-455 2001}
}

@item{
  author = {Blelloch G, Burch H, Crary K, et al.}
  title = {Persistent triangulations}
  where = {J FUNCT PROGRAM 11: 441-466 Part 5 SEP 2001}
}

@item{
  author = {Meineke FA, Potten CS, Loeffler M}
  title = {Cell migration and organization in the intestinal crypt using a lattice-free model}
  where = {CELL PROLIFERAT 34 (4): 253-266 AUG 2001}
}

@item{
  author = {Tucker GE, Lancaster ST, Gasparini NM, et al.}
  title = {An object-oriented framework for distributed hydrologic and geomorphic modeling using triangulated irregular networks}
  where = {COMPUT GEOSCI-UK 27 (8): 959-973 OCT 2001}
}

@item{
  author = {Vinicius M, Andrade A, Stolfi J}
  title = {Exact algorithms for circles on the sphere}
  where = {INT J COMPUT GEOM AP 11 (3): 267-290 JUN 2001}
}

@item{
  author = {Anton F, Mioc D, Fournier A}
  title = {Reconstructing 2D images with natural neighbour interpolation}
  where = {VISUAL COMPUT 17 (3): 134-146 2001}
}

@item{
  author = {Weihe K}
  title = {A software engineering perspective on algorithmics}
  where = {ACM COMPUT SURV 33 (1): 89-134 MAR 2001}
}

@item{
  author = {Cheng HL, Dey TK, Edelsbrunner H, et al.}
  title = {Dynamic skin triangulation}
  where = {DISCRETE COMPUT GEOM 25 (4): 525-568 JUN 2001}
}

@item{
  author = {Gold C, Snoeyink J}
  title = {A one-step crust and skeleton extraction algorithm}
  where = {ALGORITHMICA 30 (2): 144-163 Sp. Iss. SI JUN 2001}
}

@item{
  author = {Tamassia R, Vismara L}
  title = {A case study in algorithm engineering for geometric computing}
  where = {INT J COMPUT GEOM AP 11 (1): 15-70 FEB 2001}
}

@item{
  author = {Ristic M, Brujic D, Handayani S}
  title = {CAD-based triangulation of unordered data using trimmed NURBS models}
  where = {J MATER PROCESS TECH 107 (1-3): 60-70 NOV 22 2000}
}

@item{
  author = {Lemaire C, Moreau JM}
  title = {A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case}
  where = {COMP GEOM-THEOR APPL 17 (1-2): 69-96 OCT 2000}
}

@item{
  author = {Gold C, Mostafavi MA}
  title = {Towards the global GIS}
  where = {ISPRS J PHOTOGRAMM 55 (3): 150-163 SEP 2000}
}

@item{
  author = {Ristic M, Brujic D, Handayani S}
  title = {Efficient CAD-based triangulation of unordered 3D data}
  where = {MACH VISION APPL 12 (2): 98-106 SEP 2000}
}

@item{
  author = {Mattiussi C}
  title = {The finite volume, finite element, and finite difference methods as numerical methods for physical field problems}
  where = {ADV IMAG ELECT PHYS 113: 1-146 2000}
}

@item{
  author = {Ristic M, Brujic D, Handayani S}
  title = {Triangulation of unordered data using trimmed NURBS computer aided design models}
  where = {P I MECH ENG B-J ENG 214 (6): 509-514 2000}
}

@item{
  author = {Ward G, Simmons M}
  title = {The holodeck ray cache: An interactive rendering system for global illumination in nondiffuse environments}
  where = {ACM T GRAPHIC 18 (4): 361-398 OCT 1999}
}

@item{
  author = {Dufourd JF, Puitg F}
  title = {Functional specification and prototyping with oriented combinatorial maps}
  where = {COMP GEOM-THEOR APPL 16 (2): 129-156 JUN 2000}
}

@item{
  author = {Bauer R}
  title = {Distribution of points on a sphere with application to star catalogs}
  where = {J GUID CONTROL DYNAM 23 (1): 130-137 JAN-FEB 2000}
}

@item{
  author = {Tang K, Chou SY, Chen LL, et al.}
  title = {Tetrahedral mesh generation for solids based on alternating sum of volumes}
  where = {COMPUT IND 41 (1): 65-81 JAN 2000}
}

@item{
  author = {Durand F, Drettakis G, Puech C}
  title = {Fast and accurate hierarchical radiosity using global visibility}
  where = {ACM T GRAPHIC 18 (2): 128-170 APR 1999}
}

@item{
  author = {Cazier D, Dufourd JF}
  title = {A formal specification of geometric refinements}
  where = {VISUAL COMPUT 15 (6): 279-301 1999}
}

@item{
  author = {Guibas LJ, Latombe JC, Lavalle SM, et al.}
  title = {A visibility-based pursuit-evasion problem}
  where = {INT J COMPUT GEOM AP 9 (4-5): 471-493 AUG-OCT 1999}
}

@item{
  author = {Anupam}
  title = {Delaunay triangulation based surface modelling and three-dimensional visualisation of landforms}
  where = {IETE TECH REV 15 (6): 425-433 NOV-DEC 1998}
}

@item{
  author = {Kettner L}
  title = {Using generic programming for designing a data structure for polyhedral surfaces}
  where = {COMP GEOM-THEOR APPL 13 (1): 65-90 MAY 1999}
}

@item{
  author = {Bohringer KE, Donald BR, Halperin D}
  title = {On the area bisectors of a polygon}
  where = {DISCRETE COMPUT GEOM 22 (2): 269-285 SEP 1999}
}

@item{
  author = {Blelloch GE, Hardwick JC, Miller GL, et al.}
  title = {Design and implementation of a practical parallel Delaunay algorithm}
  where = {ALGORITHMICA 24 (3-4): 243-269 JUL-AUG 1999}
}

@item{
  author = {Dey TK, Guha S}
  title = {Transforming curves on surfaces}
  author = {J COMPUT SYST SCI 58 (2): 297-325 APR 1999 }
}

@item{
  author = {Papadopoulou E, Lee DT}
  title = {Critical area computation via Voronoi diagrams}
  where = {IEEE T COMPUT AID D 18 (4): 463-474 APR 1999}
}

@item{
  author = {Mucke EP, Saias I, Zhu B}
  title = {Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations}
  where = {COMP GEOM-THEOR APPL 12 (1-2): 63-83 FEB 1999}
}

@item{
  author = {Feito FR, Rivero M}
  title = {Geometric modelling based on simplicial chains}
  where = {COMPUT GRAPH 22 (5): 611-619 OCT 1998}
}

@item{
  author = {Halperin D, Overmars MH}
  title = {Spheres, molecules, and hidden surface removal}
  where = {COMP GEOM-THEOR APPL 11 (2): 83-102 OCT 1998}
}

@item{
  author = {Devroye L, Mucke EP, Zhu BH}
  title = {A note on point location in delaunay triangulations of random points}
  where = {ALGORITHMICA 22 (4): 477-482 DEC 1998}
}

@item{
  author = {Malassiotis S, Strintzis MG}
  title = {Tracking textured deformable objects using a finite-element mesh}
  where = {IEEE T CIRC SYST VID 8 (6): 756-774 OCT 1998}
}

@item{
  author = {Liotta G, Preparata FP, Tamassia R}
  title = {Robust proximity queries: An illustration of degree-driven algorithm design}
  where = {SIAM J COMPUT 28 (3): 864-889 SEP 14 1998}
}

@item{
  author = {Barequet G}
  title = {DCEL: A polyhedral database and programming environment}
  where = {INT J COMPUT GEOM AP 8 (5-6): 619-636 OCT-DEC 1998}
}

@item{
  author = {Goodrich MT, Tamassia R}
  title = {Dynamic trees and dynamic point location}
  where = {SIAM J COMPUT 28 (2): 612-636 1998}
}

@item{
  author = {Guibas LJ, Latombe JC, LaValle SM, et al.}
  title = {Visibility-based pursuit-evasion in a polygonal environment}
  where = {LECT NOTES COMPUT SC 1272: 17-30 1997}
}

@item{
  author = {Albers G, Guibas LJ, Mitchell JSB, et al.}
  title = {Voronoi diagrams of moving points}
  where = {INT J COMPUT GEOM AP 8 (3): 365-379 JUN 1998}
}

@item{
  author = {Huang CW, Shih TY}
  title = {Improvements on Sloan's algorithm for constructing Delaunay triangulations}
  where = {COMPUT GEOSCI 24 (2): 193-196 MAR 1998}
}

@item{
  author = {Trepel C, Duffy KR, Pegado VD, et al.}
  title = {Patchy distribution of NMDAR1 subunit immunoreactivity in developing visual cortex}
  where = {J NEUROSCI 18 (9): 3404-3415 MAY 1 1998}
}

@item{
  author = {Murphy KM, Jones DG, Fenstemaker SB, et al.}
  title = {Spacing of cytochrome oxidase blobs in visual cortex of normal and strabismic monkeys}
  where = {CEREB CORTEX 8 (3): 237-244 APR-MAY 1998}
}

@item{
  author = {Mucke EP}
  title = {A robust implementation for three-dimensional delaunay triangulations}
  where = {INT J COMPUT GEOM AP 8 (2): 255-276 APR 1998}
}

@item{
  author = {de Berg M, Dobrindt KTG}
  title = {On levels of detail in terrains}
  where = {GRAPH MODEL IM PROC 60 (1): 1-12 JAN 1998}
}

@item{
  author = {Hershberger JE, Snoeyink JS}
  title = {Erased arrangements of lines and convex decompositions of polyhedra}
  where = {COMP GEOM-THEOR APPL 9 (3): 129-143 FEB 1998}
}

@item{
  author = {Seidel R}
  title = {The nature and meaning of perturbations in geometric computing}
  where = {DISCRETE COMPUT GEOM 19 (1): 1-17 JAN 1998}
}

@item{
  author = {Brown PJC}
  title = {A fast algorithm for selective refinement of terrain meshes}
  where = {COMPUT NETWORKS ISDN 29 (14): 1587-1599 OCT 1997}
}

@item{
  author = {Haigh KZ, Shewchuk JR, Veloso MM}
  title = {Exploiting domain geometry in analogical route planning}
  where = {J EXP THEOR ARTIF IN 9 (4): 509-541 OCT-DEC 1997}
}

@item{
  author = {Sequeira RE, Preteux FJ}
  title = {Discrete Voronoi diagrams and the SKIZ operator: A dynamic algorithm}
  where = {IEEE T PATTERN ANAL 19 (10): 1165-1170 OCT 1997}
}

@item{
  author = {Michelucci D, Moreau JM}
  title = {Lazy arithmetic}
  where = {IEEE T COMPUT 46 (9): 961-975 SEP 1997}
}

@item{
  author = {Shewchuk JR}
  title = {Adaptive precision floating-point arithmetic and fast robust geometric predicates}
  where = {DISCRETE COMPUT GEOM 18 (3): 305-363 OCT 1997}
}

@item{
  author = {Rivara MC}
  title = {New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations}
  where = {INT J NUMER METH ENG 40 (18): 3313-3324 SEP 30 1997}
}

@item{
  author = {Kobylarz TJ, Pachter M, Houpis CH}
  title = {Fuzzy scheduling of regional QFT controllers}
  where = {INT J ROBUST NONLIN 7 (6): 661-674 JUN 1997}
}

@item{
  author = {Dufourd JF}
  title = {Algebras and formal specifications in geometric modelling}
  where = {VISUAL COMPUT 13 (3): 131-154 1997}
}

@item{
  author = {Berman P, Lingas A}
  title = {A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon}
  where = {THEOR COMPUT SCI 174 (1-2): 193-202 MAR 15 1997}
}

@item{
  author = {Sedykh VD}
  title = {Theorem on four support vertices of a polygonal line}
  where = {FUNCT ANAL APPL+ 30 (3): 216-218 JUL-SEP 1996}
}

@item{
  author = {Huang CW, Shih TY}
  title = {On the complexity of point-in-polygon algorithms}
  where = {COMPUT GEOSCI 23 (1): 109-118 FEB 1997}
}

@item{
  author = {Simpson RB}
  title = {A data modeling abstraction for describing triangular mesh algorithms}
  where = {BIT 37 (1): 138-163 MAR 1997}
}

@item{
  author = {Caffau E, Coren F, Giannini G}
  title = {Underground cosmic-ray measurement for morphological reconstruction of the ''Grotta Gigante'' natural cave}
  where = {NUCL INSTRUM METH A 385 (3): 480-488 FEB 1 1997}
}

@item{
  author = {Rivara MC, Inostroza P}
  title = {Using longest-side bisection techniques for the automatic refinement of Delaunay triangulations}
  where = {INT J NUMER METH ENG 40 (4): 581-597 FEB 28 1997}
}

@item{
  author = {Cavalcanti PR, Carvalho PCP, Martha LF}
  title = {Non manifold modelling: An approach based on spatial subdivision}
  where = {COMPUT AIDED DESIGN 29 (3): 209-220 MAR 1997}
}

@item{
  author = {Fortune S}
  title = {Polyhedral modelling with multiprecision integer arithmetic}
  where = {COMPUT AIDED DESIGN 29 (2): 123-133 FEB 1997}
}

@item{
  author = {Akkiraju N, Edelsbrunner H}
  title = {Triangulating the surface of a molecule}
  where = {DISCRETE APPL MATH 71 (1-3): 5-22 DEC 5 1996}
}

@item{
  author = {Cole R, Goodrich MT, ODunlaing C}
  title = {A nearly optimal deterministic parallel Voronoi diagram algorithm}
  where = {ALGORITHMICA 16 (6): 569-617 DEC 1996}
}

@item{
  author = {Kerkhoven T}
  title = {Piecewise linear Petrov-Galerkin error estimates for the box method}
  where = {SIAM J NUMER ANAL 33 (5): 1864-1884 OCT 1996}
}

@item{
  author = {DeFloriani L, Marzano P, Puppo E}
  title = {Multiresolution models for topographic surface description}
  where = {VISUAL COMPUT 12 (7): 317-345 1996}
}

@item{
  author = {Santos F}
  title = {On Delaunay oriented matroids for convex distance functions}
  where = {DISCRETE COMPUT GEOM 16 (2): 197-210 SEP 1996}
}

@item{
  author = {Gavrilova M, Rokne J}
  title = {An efficient algorithm for construction of the power diagram from the Voronoi diagram in the plane}
  where = {INT J COMPUT MATH 61 (1-2): 49-61 1996 }
}

@item{
  author = {Tuohy ST, Patrikalakis NM}
  title = {Non-linear data representation for ocean exploration and visualization}
  where = {J VISUAL COMP ANIMAT 7 (3): 125-139 JUL-SEP 1996}
}

@item{
  author = {Fortune S, VanWyk CJ}
  title = {Static analysis yields efficient exact integer arithmetic for computational geometry}
  where = {ACM T GRAPHIC 15 (3): 223-248 JUL 1996}
}

@item{
  author = {Giammarresi D, Italiano GF}
  title = {Decremental 2- and 3-connectivity on planar graphs}
  where = {ALGORITHMICA 16 (3): 263-287 SEP 1996}
}

@item{
  author = {Prasad NS, Sankaranarayanan TK}
  title = {Estimation of residual stresses in weldments using adaptive grids}
  where = {COMPUT STRUCT 60 (6): 1037-1045 JUL 24 1996}
}

@item{
  author = {deBerg M}
  title = {Computing half-plane and strip discrepancy of planar point sets}
  where = {COMP GEOM-THEOR APPL 6 (2): 69-83 MAY 1996}
}

@item{
  author = {Sherbrooke EC, Patrikalakis NM, Brisson E}
  title = {An algorithm for the medial axis transform of 3D polyhedral solids}
  where = {IEEE T VIS COMPUT GR 2 (1): 44-61 MAR 1996}
}

@item{
  author = {Barequet G, Sharir M}
  title = {Piecewise-linear interpolation between polygonal slices}
  where = {COMPUT VIS IMAGE UND 63 (2): 251-272 MAR 1996}
}

@item{
  author = {DeFloriani L, Puppo E}
  title = {Hierarchical triangulation for multiresolution surface description}
  where = {ACM T GRAPHIC 14 (4): 363-411 OCT 1995}
}

@item{
  author = {Avis D, Fukuda K}
  title = {Reverse search for enumeration}
  where = {DISCRETE APPL MATH 65 (1-3): 21-46 MAR 7 1996}
}

@item{
  author = {Tan TS}
  title = {An optimal bound for high-quality conforming triangulations}
  where = {DISCRETE COMPUT GEOM 15 (2): 169-193 MAR 1996}
}

@item{
  author = {Finke U, Hinrichs KH}
  title = {The quad view data structure - A representation for planar subdivisions}
  where = {LECT NOTES COMPUT SC 951: 29-46 1995}
}

@item{
  author = {Seidl T, Kriegel HP}
  title = {A 3D molecular surface representation supporting neighborhood queries}
  where = {LECT NOTES COMPUT SC 951: 240-258 1995}
}

@item{
  author = {Zweig G}
  title = {An effective tour construction and improvement procedure for the traveling salesman problem}
  where = {OPER RES 43 (6): 1049-1057 NOV-DEC 1995}
}

@item{
  author = {TAKAHASHI S, IKEDA T, SHINAGAWA Y, et al.}
  title = {ALGORITHMS FOR EXTRACTING CORRECT CRITICAL-POINTS AND CONSTRUCTING TOPOLOGICAL GRAPHS FROM DISCRETE GEOGRAPHICAL ELEVATION DATA}
  where = {COMPUT GRAPH FORUM 14 (3): C181-& Sp. Iss. CI AUG 28 1995}
}

@item{
  author = {CARLISLE MC, ROGERS A}
  title = {SOFTWARE CACHING AND COMPUTATION MIGRATION IN OLDEN}
  where = {SIGPLAN NOTICES 30 (8): 29-38 AUG 1995}
}

@item{
  author = {OISHI Y, SUGIHARA K}
  title = {TOPOLOGY-ORIENTED DIVIDE-AND-CONQUER ALGORITHM FOR VORONOI DIAGRAMS}
  where = {GRAPH MODEL IM PROC 57 (4): 303-314 JUL 1995}
}

@item{
  author = {DJIDJEV HN, LINGAS A}
  title = {ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS}
  where = {INT J COMPUT GEOM AP 5 (3): 327-337 SEP 1995}
}

@item{
  author = {FORTUNE S}
  title = {NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS}
  where = {INT J COMPUT GEOM AP 5 (1-2): 193-213 MAR-JUN 1995}
}

@item{
  author = {ROGERS A, CARLISLE MC, REPPY JH, et al.}
  title = {SUPPORTING DYNAMIC DATA-STRUCTURES ON DISTRIBUTED-MEMORY MACHINES}
  where = {ACM T PROGR LANG SYS 17 (2): 233-263 MAR 1995}
}


@item{
  author = {RUPPERT J}
  title = {A DELAUNAY REFINEMENT ALGORITHM FOR QUALITY 2-DIMENSIONAL MESH GENERATION}
  where = {J ALGORITHM 18 (3): 548-585 MAY 1995}
}

@item{
  author = {BAREQUET G, SHARIR M}
  title = {FILLING GAPS IN THE BOUNDARY OF A POLYHEDRON}
  where = {COMPUT AIDED GEOM D 12 (2): 207-229 MAR 1995}
}

@item{
  author = {MARTONEN TB, YANG Y, HWANG D, et al.}
  title = {MAPPING THE HUMAN LUNG USING DELAUNAY TESSELLATION}
  where = {COMPUT BIOMED RES 27 (4): 245-262 AUG 1994}
}

@item{
  author = {RAJAN VT}
  title = {OPTIMALITY OF THE DELAUNAY TRIANGULATION IN RD}
  where = {DISCRETE COMPUT GEOM 12 (2): 189-202 SEP 1994}
}

@item{
  author = {RATSCHEK H, ROKNE J}
  title = {BOX SPHERE INTERSECTION TESTS}
  where = {COMPUT AIDED DESIGN 26 (7): 579-584 JUL 1994}
}

@item{
  author = {EDELSBRUNNER H, MUCKE EP}
  title = {3-DIMENSIONAL ALPHA-SHAPES}
  where = {ACM T GRAPHIC 13 (1): 43-72 JAN 1994}
}

@item{
  author = {HERSHBERGER J, SNOEYINK J}
  title = {COMPUTING MINIMUM LENGTH PATHS OF A GIVEN HOMOTOPY CLASS}
  where = {COMP GEOM-THEOR APPL 4 (2): 63-97 JUN 1994}
}

@item{
  author = {CLARE AR}
  title = {EXPERIMENTS IN THE PARALLEL COMPUTATION OF 3D CONVEX HULLS}
  where = {COMPUT GRAPH FORUM 13 (1): 21-36 MAR 1994}
}

@item{
  author = {NACKMAN LR, SRINIVASAN V}
  title = {POINT PLACEMENT ALGORITHMS FOR DELAUNAY TRIANGULATION OF POLYGONAL DOMAINS}
  where = {ALGORITHMICA 12 (1): 1-17 JUL 1994}
}

@item{
  author = {PRASAD NS, HARI BS, GANTI SP}
  title = {AN ADAPTIVE MESH GENERATION SCHEME FOR FINITE-ELEMENT ANALYSIS}
  where = {COMPUT STRUCT 50 (1): 1-9 JAN 3 1994}
}

@item{
  author = {VANDEWEYGAERT R}
  title = {FRAGMENTING THE UNIVERSE .3. THE CONSTRUCTION AND STATISTICS OF 3-D VORONOI TESSELLATIONS}
  where = {ASTRON ASTROPHYS 283 (2): 361-406 MAR 1994}
}

@item{
  author = {BERTRAND Y, DUFOURD JF}
  title = {ALGEBRAIC SPECIFICATION OF A 3D-MODELER BASED ON HYPERMAPS}
  where = {CVGIP-GRAPH MODEL IM 56 (1): 29-60 JAN 1994}
}

@item{
  author = {KLEIN R, MEHLHORN K, MEISER S}
  title = {RANDOMIZED INCREMENTAL CONSTRUCTION OF ABSTRACT VORONOI DIAGRAMS}
  where = {COMP GEOM-THEOR APPL 3 (3): 157-184 AUG 1993}
}

@item{
  author = {CHEN LL, CHOU SY, WOO TC}
  title = {SEPARATING AND INTERSECTING SPHERICAL POLYGONS - COMPUTING MACHINABILITY ON 3-AXIS, 4-AXIS AND 5-AXIS NUMERICALLY CONTROLLED MACHINES}
  where = {ACM T GRAPHIC 12 (4): 305-326 OCT 1993}
}

@item{
  author = {FORTUNE S}
  title = {A NOTE ON DELAUNAY DIAGONAL FLIPS}
  where = {PATTERN RECOGN LETT 14 (9): 723-726 SEP 1993}
}

@item{
  author = {EDELSBRUNNER H, TAN TS}
  title = {AN UPPER BOUND FOR CONFORMING DELAUNAY TRIANGULATIONS}
  where = {DISCRETE COMPUT GEOM 10 (2): 197-213 1993}
}

@item{
  author = {BERN M, EDELSBRUNNER H, EPPSTEIN D, et al.}
  title = {EDGE INSERTION FOR OPTIMAL TRIANGULATIONS}
  where = {DISCRETE COMPUT GEOM 10 (1): 47-65 1993}
}

@item{
  author = {RATSCHEK H, ROKNE J}
  title = {TEST FOR INTERSECTION BETWEEN CIRCLE AND RECTANGLE}
  where = {APPL MATH LETT 6 (4): 21-23 JUL 1993}
}

@item{
  author = {ROOS T}
  title = {VORONOI DIAGRAMS OVER DYNAMIC SCENES}
  where = {DISCRETE APPL MATH 43 (3): 243-259 JUN 10 1993}
}

@item{
  author = {ROOS T, NOLTEMEIER H}
  title = {DYNAMIC VORONOI DIAGRAMS IN MOTION PLANNING}
  where = {LECT NOTES COMPUT SC 553: 227-236 1991}
}

@item{
  author = {GIAMMARRESI D, ITALIANO GF}
  title = {DYNAMIC 2-CONNECTIVITY AND 3-CONNECTIVITY ON PLANAR GRAPHS}
  where = {LECT NOTES COMPUT SC 621: 221-232 1992}
}

@item{
  author = {ALBERS G, ROOS T}
  title = {VORONOI DIAGRAMS OF MOVING POINTS IN HIGHER-DIMENSIONAL SPACES}
  where = {LECT NOTES COMPUT SC 621: 399-409 1992}
}

@item{
  author = {ROOS T, ALBERS G}
  title = {MAINTAINING PROXIMITY IN HIGHER-DIMENSIONAL SPACES}
  where = {LECT NOTES COMPUT SC 629: 483-493 1992}
}

@item{
  author = {ROOS T, NOLTEMEIER H}
  title = {DYNAMIC VORONOI DIAGRAMS IN MOTION PLANNING}
  where = {LECT NOTES CONTR INF 180: 102-111 1992}
}

@item{
  author = {GUIBAS LJ, MITCHELL JSB, ROOS T}
  title = {VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE}
  where = {LECT NOTES COMPUT SC 570: 113-125 1992}
}

@item{
  author = {EDELSBRUNNER H, TAN TS}
  title = {A QUADRATIC TIME ALGORITHM FOR THE MINMAX LENGTH TRIANGULATION}
  where = {SIAM J COMPUT 22 (3): 527-551 JUN 1993}
}

@item{
  author = {BRISSON E}
  title = {REPRESENTING GEOMETRIC STRUCTURES IN D-DIMENSIONS - TOPOLOGY AND ORDER}
  where = {DISCRETE COMPUT GEOM 9 (4): 387-426 1993}
}

@item{
  author = {FANG TP, PIEGL LA}
  title = {DELAUNAY TRIANGULATION USING A UNIFORM GRID}
  where = {IEEE COMPUT GRAPH 13 (3): 36-47 MAY 1993}
}

@item{
  author = {BOISSONNAT JD, TEILLAUD M}
  title = {ON THE RANDOMIZED CONSTRUCTION OF THE DELAUNAY TREE}
  where = {THEOR COMPUT SCI 112 (2): 339-354 MAY 10 1993}
}

@item{
  author = {MOORE REM, ANGELL IO}
  title = {VORONOI POLYGONS AND POLYHEDRA}
  where = {J COMPUT PHYS 105 (2): 301-305 APR 1993}
}

@item{
  author = {DESCHUTTER G, TAERWE L}
  title = {RANDOM PARTICLE MODEL FOR CONCRETE BASED ON DELAUNAY TRIANGULATION}
  where = {MATER STRUCT 26 (156): 67-73 MAR 1993}
}

@item{
  author = {KNUTH DE}
  title = {AXIOMS AND HULLS}
  where = {LECT NOTES COMPUT SC 606: R3-& 1992}
}

@item{
  author = {LOZE MK, SAUNDERS R}
  title = {2 SIMPLE ALGORITHMS FOR CONSTRUCTING A 2-DIMENSIONAL CONSTRAINED DELAUNAY TRIANGULATION}
  where = {APPL NUMER MATH 11 (5): 403-418 MAR 1993}
}

@item{
  author = {PAOLUZZI A, BERNARDINI F, CATTANI C, et al.}
  title = {DIMENSION-INDEPENDENT MODELING WITH SIMPLICIAL COMPLEXES}
  where = {ACM T GRAPHIC 12 (1): 56-102 JAN 1993}
}

@item{
  author = {PEUQUET DJ}
  title = {AN ALGORITHM FOR CALCULATING MINIMUM EUCLIDEAN DISTANCE BETWEEN 2 GEOGRAPHIC FEATURES}
  where = {COMPUT GEOSCI 18 (8): 989-1001 SEP 1992}
}

@item{
  author = {MOIGNARD C, LIEGEOIS A}
  title = {OPTIMAL MOTIONS PLANNING FOR MOBILE ROBOTS ON UNEVEN TERRAINS}
  where = {RAIRO-AUTOM PROD INF 26 (4): 315-334 1992}
}

@item{
  author = {BERN M, EDELSBRUNNER H, EPPSTEIN D, et al.}
  title = {EDGE INSERTION FOR OPTIMAL TRIANGULATIONS}
  where = {LECT NOTES COMPUT SC 583: 46-60 1992}
}

@item{
  author = {HUTTENLOCHER DP, KEDEM K, KLEINBERG JM}
  title = {VORONOI DIAGRAMS OF RIGIDLY MOVING SETS OF POINTS}
  where = {INFORM PROCESS LETT 43 (4): 217-223 SEP 28 1992}
}

@item{
  author = {REQUICHA AAG, ROSSIGNAC JR}
  title = {SOLID MODELING AND BEYOND}
  where = {IEEE COMPUT GRAPH 12 (5): 31-44 SEP 1992}
}

@item{
  author = {FANG TP, PIEGL LA}
  title = {ALGORITHM FOR DELAUNAY TRIANGULATION AND CONVEX-HULL COMPUTATION USING A SPARSE-MATRIX}
  where = {COMPUT AIDED DESIGN 24 (8): 425-436 AUG 1992}
}

@item{
  author = {MELISSARATOS EA, SOUVAINE DL}
  title = {SHORTEST PATHS HELP SOLVE GEOMETRIC OPTIMIZATION PROBLEMS IN PLANAR REGIONS}
  where = {SIAM J COMPUT 21 (4): 601-638 AUG 1992}
}

@item{
  author = {EDELSBRUNNER H, TAN TS, WAUPOTITSCH R}
  title = {AN O(N2LOGN) TIME ALGORITHM FOR THE MINMAX ANGLE TRIANGULATION}
  where = {SIAM J SCI STAT COMP 13 (4): 994-1008 JUL 1992}
}

@item{
  author = {WILLIAMS PL}
  title = {VISIBILITY ORDERING MESHED POLYHEDRA}
  where = {ACM T GRAPHIC 11 (2): 103-126 APR 1992}
}

@item{
  author = {MALLET JL}
  title = {DISCRETE SMOOTH INTERPOLATION IN GEOMETRIC MODELING}
  where = {COMPUT AIDED DESIGN 24 (4): 178-191 APR 1992}
}

@item{
  author = {GUIBAS LJ, KNUTH DE, SHARIR M}
  title = {RANDOMIZED INCREMENTAL CONSTRUCTION OF DELAUNAY AND VORONOI DIAGRAMS}
  where = {ALGORITHMICA 7 (4): 381-413 1992}
}

@item{
  author = {EPPSTEIN D, ITALIANO GF, TAMASSIA R, et al.}
  title = {MAINTENANCE OF A MINIMUM SPANNING FOREST IN A DYNAMIC PLANE GRAPH}
  where = {J ALGORITHM 13 (1): 33-54 MAR 1992}
}

@item{
  author = {APPEL RD, HOCHSTRASSER DF, FUNK M, et al.}
  title = {THE MELANIE PROJECT - FROM A BIOPSY TO AUTOMATIC PROTEIN MAP INTERPRETATION BY COMPUTER}
  where = {ELECTROPHORESIS 12 (10): 722-735 OCT 1991}
}

@item{
  author = {AURENHAMMER F}
  title = {VORONOI DIAGRAMS - A SURVEY OF A FUNDAMENTAL GEOMETRIC DATA STRUCTURE}
  where = {COMPUT SURV 23 (3): 345-405 SEP 1991}
}

@item{
  author = {DEVILLERS O, MEISER S, TEILLAUD M}
  title = {FULLY DYNAMIC DELAUNAY TRIANGULATION IN LOGARITHMIC EXPECTED TIME PER OPERATION}
  where = {LECT NOTES COMPUT SC 519: 42-53 1991}
}

@item{
  author = {DJIDJEV H, LINGAS A}
  title = {ON COMPUTING THE VORONOI DIAGRAM FOR RESTRICTED PLANAR FIGURES}
  where = {LECT NOTES COMPUT SC 519: 54-64 1991}
}

@item{
  author = {HERSHBERGER J, SNOEYINK J}
  title = {COMPUTING MINIMUM LENGTH PATHS OF A GIVEN HOMOTOPY CLASS}
  where = {LECT NOTES COMPUT SC 519: 331-342 1991}
}

@item{
  author = {CONTI P, HITSCHFELD N, FICHTNER W}
  title = {OMEGA - AN OCTREE-BASED MIXED ELEMENT GRID ALLOCATOR FOR THE SIMULATION OF COMPLEX 3-D DEVICE STRUCTURES}
  where = {IEEE T COMPUT AID D 10 (10): 1231-1241 OCT 1991}
}

@item{
  author = {BURGLER JF, COUGHRAN WM, FICHTNER W}
  title = {AN ADAPTIVE GRID REFINEMENT STRATEGY FOR THE DRIFT-DIFFUSION EQUATIONS}
  where = {IEEE T COMPUT AID D 10 (10): 1251-1258 OCT 1991}
}

@item{
  author = {SPEHNER JC}
  title = {MERGING IN MAPS AND IN PAVINGS}
  where = {THEOR COMPUT SCI 86 (2): 205-232 SEP 2 1991}
}

@item{
  author = {ARQUES D, JACQUES I}
  title = {NON-ORGANIZED-SOLIDS - DEFINITION IMPLANTATION AND MOVEMENT IN-SPACE}
  where = {RAIRO-INF THEOR APPL 25 (3): 219-246 1991}
}

@item{
  author = {TIPPER JC}
  title = {FORTRAN PROGRAMS TO CONSTRUCT THE PLANAR VORONOI DIAGRAM}
  where = {COMPUT GEOSCI 17 (5): 597-632 1991}
}

@item{
  author = {LIENHARDT P}
  title = {SUBDIVISIONS OF SURFACES AND TOPOLOGICAL 2-MAPS}
  where = {RAIRO-INF THEOR APPL 25 (2): 171-202 1991}
}

@item{
  author = {ROSENBERGER H}
  title = {ORDER-K VORONOI DIAGRAMS OF SITES WITH ADDITIVE WEIGHTS IN THE PLANE}
  where = {ALGORITHMICA 6 (4): 490-521 1991}
}

@item{
  author = {DAY AM}
  title = {PARALLEL IMPLEMENTATION OF 3D CONVEX-HULL ALGORITHM}
  where = {COMPUT AIDED DESIGN 23 (3): 177-188 APR 1991}
}

@item{
  author = {NACKMAN LR, SRINIVASAN V}
  title = {BISECTORS OF LINEARLY SEPARABLE SETS}
  where = {DISCRETE COMPUT GEOM 6 (3): 263-275 1991}
}

@item{
  author = {PALACIOSVELEZ O, RENAUD BC}
  title = {A DYNAMIC HIERARCHICAL SUBDIVISION ALGORITHM FOR COMPUTING DELAUNAY TRIANGULATIONS AND OTHER CLOSEST-POINT PROBLEMS}
  where = {ACM T MATH SOFTWARE 16 (3): 275-292 SEP 1990 }
}

@item{
  author = {DUFOURD JF}
  title = {FORMAL SPECIFICATION OF TOPOLOGICAL SUBDIVISIONS USING HYPERMAPS}
  where = {COMPUT AIDED DESIGN 23 (2): 99-116 MAR 1991}
}

@item{
  author = {MITCHELL JSB, PAPADIMITRIOU CH}
  title = {THE WEIGHTED REGION PROBLEM - FINDING SHORTEST PATHS THROUGH A WEIGHTED PLANAR SUBDIVISION}
  where = {J ACM 38 (1): 18-73 JAN 1991}
}

@item{
  author = {LIENHARDT P}
  title = {TOPOLOGICAL MODELS FOR BOUNDARY REPRESENTATION - A COMPARISON WITH N-DIMENSIONAL GENERALIZED MAPS}
  where = {COMPUT AIDED DESIGN 23 (1): 59-82 JAN-FEB 1991}
}

@item{
  author = {KARASICK M, LIEBER D, NACKMAN LR}
  title = {EFFICIENT DELAUNAY TRIANGULATION USING RATIONAL ARITHMETIC}
  where = {ACM T GRAPHIC 10 (1): 71-91 JAN 1991}
}

@item{
  author = {SHUTE GM, DENEEN LL, THOMBORSON CD}
  title = {AN O(N LOG N) PLANE-SWEEP ALGORITHM FOR L1 AND L-INFINITY DELAUNAY TRIANGULATIONS}
  where = {ALGORITHMICA 6 (2): 207-221 1991}
}

@item{
  author = {ELBAZ M, SPEHNER JC}
  title = {CONSTRUCTION OF VORONOI DIAGRAMS IN THE PLANE BY USING MAPS}
  where = {THEOR COMPUT SCI 77 (3): 331-343 DEC 15 1990}
}

@item{
  author = {KLEIN R, MEHLHORN K, MEISER S}
  title = {ON THE CONSTRUCTION OF ABSTRACT VORONOI DIAGRAMS .2.}
  where = {LECT NOTES COMPUT SC 450: 138-154 1990}
}

@item{
  author = {GUIBAS LJ, KNUTH DE, SHARIR M}
  title = {RANDOMIZED INCREMENTAL CONSTRUCTION OF DELAUNAY AND VORONOI DIAGRAMS}
  where = {LECT NOTES COMPUT SC 443: 414-431 1990}
}

@item{
  author = {EDELSBRUNNER H, MUCKE EP}
  title = {SIMULATION OF SIMPLICITY - A TECHNIQUE TO COPE WITH DEGENERATE CASES IN GEOMETRIC ALGORITHMS}
  where = {ACM T GRAPHIC 9 (1): 66-104 JAN 1990}
}

@item{
  author = {DAY AM}
  title = {THE IMPLEMENTATION OF AN ALGORITHM TO FIND THE CONVEX-HULL OF A SET OF 3-DIMENSIONAL POINTS}
  where = {ACM T GRAPHIC 9 (1): 105-132 JAN 1990}
}


@item{
  author = {HUANG NF}
  title = {A DIVIDE-AND-CONQUER ALGORITHM FOR CONSTRUCTING RELATIVE NEIGHBORHOOD GRAPH}
  where = {BIT 30 (2): 196-206 1990}
}

@item{
  author = {MOUNT DM}
  title = {THE NUMBER OF SHORTEST PATHS ON THE SURFACE OF A POLYHEDRON}
  where = {SIAM J COMPUT 19 (4): 593-611 AUG 1990}
}

@item{
  author = {SPEHNER JC}
  title = {MAPS AND PAVINGS}
  where = {CR ACAD SCI I-MATH 311 (2): 143-146 JUL 19 1990}
}

@item{
  author = {CLARKSON KL, EDELSBRUNNER H, GUIBAS LJ, et al.}
  title = {COMBINATORIAL COMPLEXITY-BOUNDS FOR ARRANGEMENTS OF CURVES AND SPHERES}
  where = {DISCRETE COMPUT GEOM 5 (2): 99-160 1990}
}

@item{
  author = {MITCHELL JSB}
  title = {ON MAXIMUM FLOWS IN POLYHEDRAL DOMAINS}
  where = {J COMPUT SYST SCI 40 (1): 88-123 FEB 1990}
}

@item{
  author = {DILLENCOURT MB}
  title = {HAMILTONIAN CYCLES IN PLANAR TRIANGULATIONS WITH NO SEPARATING TRIANGLES}
  where = {J GRAPH THEOR 14 (1): 31-49 MAR 1990}
}

@item{
  author = {SAXENA S, BHATT PCP, PRASAD VC}
  title = {EFFICIENT VLSI PARALLEL ALGORITHM FOR DELAUNAY TRIANGULATION ON ORTHOGONAL TREE NETWORK IN 2-DIMENSIONS AND 3-DIMENSIONS}
  where = {IEEE T COMPUT 39 (3): 400-404 MAR 1990}
}

@item{
  author = {SCHROEDER WJ, SHEPHARD MS}
  title = {A COMBINED OCTREE DELAUNAY METHOD FOR FULLY-AUTOMATIC 3-D MESH GENERATION}
  where = {INT J NUMER METH ENG 29 (1): 37-55 JAN 1990}
}

@item{
  author = {AGGARWAL A, GUIBAS LJ, SAXE J, et al.}
  title = {A LINEAR-TIME ALGORITHM FOR COMPUTING THE VORONOI DIAGRAM OF A CONVEX POLYGON}
  where = {DISCRETE COMPUT GEOM 4 (6): 591-604 1989}
}

@item{
  author = {MALLET JL}
  title = {DISCRETE SMOOTH INTERPOLATION}
  where = {ACM T GRAPHIC 8 (2): 121-144 APR 1989 }
}

@item{
  author = {FEINBERG EB, PAPADIMITRIOU CH}
  title = {FINDING FEASIBLE PATHS FOR A 2-POINT BODY}
  where = {J ALGORITHM 10 (1): 109-119 MAR 1989}
}

@item{
  author = {CURCIO CA, SLOAN KR, MEYERS D}
  title = {COMPUTER METHODS FOR SAMPLING, RECONSTRUCTION, DISPLAY AND ANALYSIS OF RETINAL WHOLE MOUNTS}
  where = {VISION RES 29 (5): 529-& 1989}
}

@item{
  author = {KARASICK M}
  title = {THE SAME-OBJECT PROBLEM FOR POLYHEDRAL SOLIDS}
  where = {COMPUT VISION GRAPH 46 (1): 22-36 APR 1989}
}

@item{
  author = {EDELSBRUNNER H, GUIBAS LJ}
  title = {TOPOLOGICALLY SWEEPING AN ARRANGEMENT}
  where = {J COMPUT SYST SCI 38 (1): 165-194 FEB 1989}
}

@item{
  author = {HERSHBERGER J}
  title = {AN OPTIMAL VISIBILITY GRAPH ALGORITHM FOR TRIANGULATED SIMPLE POLYGONS}
  where = {ALGORITHMICA 4 (1): 141-155 1989}
}

@item{
  author = {MITCHELL JSB}
  title = {AN ALGORITHMIC APPROACH TO SOME PROBLEMS IN TERRAIN NAVIGATION}
  where = {ARTIF INTELL 37 (1-3): 171-201 DEC 1988}
}

@item{
  author = {MILENKOVIC VJ}
  title = {VERIFIABLE IMPLEMENTATIONS OF GEOMETRIC ALGORITHMS USING FINITE PRECISION ARITHMETIC}
  where = {ARTIF INTELL 37 (1-3): 377-401 DEC 1988}
}

@item{
  author = {BUCKLEY CE}
  title = {A DIVIDE AND CONQUER ALGORITHM FOR COMPUTING 4-DIMENSIONAL CONVEX HULLS}
  where = {LECT NOTES COMPUT SC 333: 113-135 1988}
}

@item{
  author = {FIELD DA}
  title = {LAPLACIAN SMOOTHING AND DELAUNAY TRIANGULATIONS}
  where = {COMMUN APPL NUMER M 4 (6): 709-712 NOV-DEC 1988}
}

@item{
  author = {OROURKE J}
  title = {COMPUTATIONAL GEOMETRY}
  where = {ANNU REV COMPUT SCI 3: 389-411 1988}
}

@item{
  author = {SCHROEDER WJ, SHEPHARD MS}
  title = {GEOMETRY-BASED FULLY-AUTOMATIC MESH GENERATION AND THE DELAUNAY TRIANGULATION}
  where = {INT J NUMER METH ENG 26 (11): 2503-2515 NOV 1988}
}

@item{
  author = {BOISSONNAT JD}
  title = {SHAPE RECONSTRUCTION FROM PLANAR CROSS-SECTIONS}
  where = {COMPUT VISION GRAPH 44 (1): 1-29 OCT 1988}
}

@item{
  author = {EDELSBRUNNER H, GUIBAS L, PACH J, et al.}
  title = {ARRANGEMENTS OF CURVES IN THE PLANE - TOPOLOGY, COMBINATORICS, AND ALGORITHMS}
  where = {LECT NOTES COMPUT SC 317: 214-229 1988}
}

@item{
  author = {LEVCOPOULOS C, KATAJAINEN J, LINGAS A}
  title = {AN OPTIMAL EXPECTED-TIME PARALLEL ALGORITHM FOR VORONOI DIAGRAMS}
  where = {LECT NOTES COMPUT SC 318: 190-198 1988}
}

@item{
  author = {LIENHARDT P}
  title = {EXTENSION OF THE NOTION OF MAP AND SUBDIVISIONS OF A 3-DIMENSIONAL SPACE}
  where = {LECT NOTES COMPUT SC 294: 301-311 1987}
}

@item{
  author = {OTTMANN T, THIEMT G, ULLRICH C}
  title = {NUMERICAL STABILITY OF SIMPLE GEOMETRIC ALGORITHMS IN THE PLANE}
  where = {LECT NOTES COMPUT SC 270: 277-293 1987}
}

@item{
  author = {EVANS DG, JONES SM}
  title = {DETECTING VORONOI (AREA-OF-INFLUENCE) POLYGONS}
  where = {MATH GEOL 19 (6): 523-537 AUG 1987}
}

@item{
  author = {MCKENNA M}
  title = {WORST-CASE OPTIMAL HIDDEN-SURFACE REMOVAL}
  where = {ACM T GRAPHIC 6 (1): 19-28 JAN 1987}
}

@item{
  author = {DWYER RA}
  title = {A FASTER DIVIDE-AND-CONQUER ALGORITHM FOR CONSTRUCTING DELAUNAY TRIANGULATIONS}
  where = {ALGORITHMICA 2 (2): 137-151 1987}
}

@item{
  author = {AKMAN V}
  title = {UNOBSTRUCTED SHORTEST PATHS IN POLYHEDRAL ENVIRONMENTS}
  where = {LECT NOTES COMPUT SC 251: U1-& 1987}
}

@item{
  author = {CHAZELLE B, EDELSBRUNNER H}
  title = {LINEAR-SPACE DATA-STRUCTURES FOR 2 TYPES OF RANGE SEARCH}
  where = {DISCRETE COMPUT GEOM 2 (2): 113-126 1987}
}

@item{
  author = {MOUNT DM}
  title = {STORING THE SUBDIVISION OF A POLYHEDRAL SURFACE}
  where = {DISCRETE COMPUT GEOM 2 (2): 153-174 1987}
}

@item{
  author = {GUIBAS LJ, SEIDEL R}
  title = {COMPUTING CONVOLUTIONS BY RECIPROCAL SEARCH}
  where = {DISCRETE COMPUT GEOM 2 (2): 175-193 1987 }
}

@item{
  author = {DeBerg M, VanKreveld M, VanOostrum R, et al.}
  title = {Simple traversal of a subdivision without extra storage}
  where = {INT J GEOGR INF SCI 11 (4): 359-373 JUN 1997}
}

@item{
  author = {VanKreveld M}
  title = {Efficient methods for isoline extraction from a TIN}
  where = {INT J GEOGR INF SYST 10 (5): 523-540 JUL-AUG 1996}
}

@item{
  author = {Zweig G}
  title = {An effective tour construction and improvement procedure for the traveling salesman problem}
  where = {OPER RES 43 (6): 1049-1057 NOV-DEC 1995}
}

@item{
  author = {MITCHELL JSB}
  title = {AN ALGORITHMIC APPROACH TO SOME PROBLEMS IN TERRAIN NAVIGATION}
  where = {ARTIF INTELL 37 (1-3): 171-201 DEC 1988}
}

@item{
  author = {MILENKOVIC VJ}
  title = {VERIFIABLE IMPLEMENTATIONS OF GEOMETRIC ALGORITHMS USING FINITE PRECISION ARITHMETIC}
  where = {ARTIF INTELL 37 (1-3): 377-401 DEC 1988}
}

# ----------------------------------------------------------------------
# ORIENTED PROJECTIVE GEOMETRY BOOK (NOT INDEXED) 
#    1   STOLFI J              ORIENTED PROJECTED G                            1991
#   29   STOLFI J              ORIENTED PROJECTIVE                             1991
# ----------------------------------------------------------------------

@item{
  author = {Fontijne D, Dorst L}
  title = {Modeling 3D euclidean geometry}
  where = {IEEE COMPUT GRAPH 23 (2): 68-78 MAR-APR 2003}
}

@item{
  author = {Barreto JP, Araujo H}
  title = {Geometric properties of central catadioptric line images}
  where = {LECT NOTES COMPUT SC 2353: 237-251 2002}
}

@item{
  author = {Bouma TA, Dorst L, Pijls HGJ}
  title = {Geometric algebra for subspace operations}
  where = {ACTA APPL MATH 73 (3): 285-300 SEP 2002}
}

@item{
  author = {Mann S, Dorst L}
  title = {Geometric algebra: A computational framework for geometrical applications Part 2}
  where = {IEEE COMPUT GRAPH 22 (4): 58-67 JUL-AUG 2002}
}

@item{
  author = {Durand F, Drettakis G, Puech C}
  title = {The 3D visibility complex}
  where = {ACM T GRAPHIC 21 (2): 176-206 APR 2002}
}

@item{
  author = {Theobald T}
  title = {An enumerative geometry framework or algorithmic line problems in R-3}
  where = {SIAM J COMPUT 31 (4): 1212-1228 MAY 8 2002}
}

@item{
  author = {Geyer C, Daniilidis K}
  title = {Catadioptric projective geometry}
  where = {INT J COMPUT VISION 45 (3): 223-243 DEC 2001}
}

@item{
  author = {Vinicius M, Andrade A, Stolfi J}
  title = {Exact algorithms for circles on the sphere}
  where = {INT J COMPUT GEOM AP 11 (3): 267-290 JUN 2001}
}

@item{
  author = {Park SW, Seo Y, Hong KS}
  title = {Real-time camera calibration for virtual studio}
  where = {REAL-TIME IMAGING 6 (6): 433-448 DEC 2000}
}

@item{
  author = {Gallier J}
  title = {A simple method for drawing a rational curve as two Bezier segments}
  where = {ACM T GRAPHIC 18 (4): 316-328 OCT 1999}
}

@item{
  author = {Erickson J}
  title = {Space-time tradeoffs or emptiness queries}
  where = {SIAM J COMPUT 29 (6): 1968-1996 APR 18 2000}
}

@item{
  author = {Dorst L, van den Boomgaard R}
  title = {The support cone: A representational tool for the analysis of boundaries and their interactions}
  where = {IEEE T PATTERN ANAL 22 (2): 174-178 FEB 2000}
}

@item{
  author = {Walker RJ, Snoeyink J}
  title = {Practical point-in-polygon tests using CSG representations of polygons}
  where = {LECT NOTES COMPUT SC 1619: 114-123 1999}
}

@item{
  author = {Goldwasser MH, Motwani R}
  title = {Complexity measures for assembly sequences}
  where = {INT J COMPUT GEOM AP 9 (4-5): 371-417 AUG-OCT 1999}
}

@item{
  author = {Eppstein D, Erickson J}
  title = {Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions}
  where = {DISCRETE COMPUT GEOM 22 (4): 569-592 DEC 1999}
}

@item{
  author = {Erickson J}
  title = {New lower bounds for convex hull problems in odd dimensions}
  where = {SIAM J COMPUT 28 (4): 1198-1214 APR 29 1999}
}

@item{
  author = {Yamaguchi F}
  title = {A shift of playground for geometric processing from euclidean to homogeneous}
  where = {VISUAL COMPUT 14 (7): 315-327 1998}
}

@item{
  author = {Barequet G, Dickerson M, Eppstein D}
  title = {On triangulating three-dimensional polygons}
  where = {COMP GEOM-THEOR APPL 10 (3): 155-170 JUN 1998}
}

@item{
  author = {Lodha SK, Goldman R}
  title = {Lattices and algorithms for bivariate Bernstein, Lagrange, Newton, and other related polynomial bases based on duality between L-bases and B-bases}
  where = {J APPROX THEORY 93 (1): 59-99 APR 1998}
}

@item{
  author = {Anderson JADW}
  title = {Representing geometrical knowledge}
  where = {PHILOS T ROY SOC B 352 (1358): 1129-1139 AUG 29 1997}
}

@item{
  author = {Koenderink JJ, VanDoorn AJ}
  title = {The generic bilinear calibration-estimation problem}
  where = {INT J COMPUT VISION 23 (3): 217-234 JUN-JUL 1997}
}

@item{
  author = {Astrom K}
  title = {The geometry of visual space: About the incompatibility between science and mathematics - Reply}
  where = {COMPUT VIS IMAGE UND 65 (3): 436-438 MAR 1997}
}

@item{
  author = {Fortune S}
  title = {Polyhedral modelling with multiprecision integer arithmetic}
  where = {COMPUT AIDED DESIGN 29 (2): 123-133 FEB 1997}
}

@item{
  author = {Erickson J}
  title = {New lower bounds for Hopcroft's problem}
  where = {DISCRETE COMPUT GEOM 16 (4): 389-418 DEC 1996}
}

@item{
  author = {Chazelle B, Edelsbrunner H, Guibas LJ, et al.}
  title = {Lines in space: Combinatorics and algorithms}
  where = {ALGORITHMICA 15 (5): 428-447 MAY 1996}
}

@item{
  author = {Kirkpatrick D, Snoeyink J}
  title = {Computing common tangents without a separating line}
  where = {LECT NOTES COMPUT SC 955: 183-193 1995}
}

@item{
  author = {NIELSEN HP}
  title = {LINE CLIPPING USING SEMI-HOMOGENEOUS COORDINATES}
  where = {COMPUT GRAPH FORUM 14 (1): 3-16 MAR 1995}
}

@item{
  author = {BLOOMENTHAL J, ROKNE J}
  title = {HOMOGENEOUS COORDINATES}
  where = {VISUAL COMPUT 11 (1): 15-26 1994}
}

@item{
  author = {YOSHIDA N, SHIOKAWA M, YAMAGUCHI F}
  title = {SOLID MODELING BASED ON A NEW PARADIGM}
  where = {COMPUT GRAPH FORUM 13 (3): C55-C64 Sp. Iss. CI SEP 12 1994}
}

@item{
  author = {CHEN LL, CHOU SY, WOO TC}
  title = {SEPARATING AND INTERSECTING SPHERICAL POLYGONS - COMPUTING MACHINABILITY ON 3-AXIS, 4-AXIS AND 5-AXIS NUMERICALLY CONTROLLED MACHINES}
  where = {ACM T GRAPHIC 12 (4): 305-326 OCT 1993}
}

# ----------------------------------------------------------------------
# ORIENTED PROJECTIVE GEOMETRY REPORT AND THESIS (NOT INDEXED)
#    1   STOLFI J              36 DIG SRC TECH REP                             1989
#    1   STOLFI J              36 DIG SRC TECHN REP                            1989
#    2   STOLFI J              36 DIG SYST RES CTR                             1989
#    1   STOLFI J              36 DIG SYST RES I RE                            1989
#    1   STOLFI J              36 SRC DEC SYST RES                             1989
#    4   STOLFI J              PRIMITIVES COMPUTATI                            1989
#    1   STOLFI J              SRC36 DIG TECHN REP                             1989
#    1   STOLFI J              SRC36 TECHN REP                                 1989
#    2   STOLFI J              THESIS STANFORD U                               1989
#    1   STOLFI J              THESIS STANFORD U CO                            1988
# ----------------------------------------------------------------------

@item{
  author = {Lodha SK, Goldman R}
  title = {Lattices and algorithms for bivariate Bernstein, Lagrange, Newton, and other related polynomial bases based on duality between L-bases and B-bases}
  where = {J APPROX THEORY 93 (1): 59-99 APR 1998}
}

@item{
  author = {Kolingerova I}
  title = {Convex polyhedron-line intersection detection using dual representation}
  where = {VISUAL COMPUT 13 (1): 42-49 1997}
}

@item{
  author = {Skala V}
  title = {Line clipping in E(2) with O(1) processing complexity}
  where = {COMPUT GRAPH 20 (4): 523-530 JUL-AUG 1996}
}

@item{
  author = {KIM DS, PAPALAMBROS PY, WOO TC}
  title = {TANGENT, NORMAL, AND VISIBILITY CONES ON BEZIER SURFACES}
  where = {COMPUT AIDED GEOM D 12 (3): 305-320 MAY 1995}
}

@item{
  author = {PELLEGRINI M}
  title = {ON LINES MISSING POLYHEDRAL-SETS IN 3-SPACE}
  where = {DISCRETE COMPUT GEOM 12 (2): 203-221 SEP 1994}
}

@item{
  author = {DEBERG M, HALPERIN D, OVERMARS M, et al.}
  title = {EFFICIENT RAY SHOOTING AND HIDDEN SURFACE REMOVAL}
  where = {ALGORITHMICA 12 (1): 30-53 JUL 1994}
}

@item{
  author = {PELLEGRINI M}
  title = {ON COLLISION-FREE PLACEMENTS OF SIMPLICES AND THE CLOSEST PAIR OF LINES IN 3-SPACE}
  where = {SIAM J COMPUT 23 (1): 133-153 FEB 1994}
}

@item{
  author = {CRAPO H, PENNE R}
  title = {CHIRALITY AND THE ISOTOPY CLASSIFICATION OF SKEW LINES IN PROJECTIVE 3-SPACE}
  where = {ADV MATH 103 (1): 1-106 JAN 1994}
}

@item{
  author = {RICHTERGEBERT J}
  title = {COMBINATORIAL OBSTRUCTIONS TO THE LIFTING OF WEAVING DIAGRAMS}
  where = {DISCRETE COMPUT GEOM 10 (3): 287-312 1993}
}

@item{
  author = {PELLEGRINI M}
  title = {RAY SHOOTING ON TRIANGLES IN 3-SPACE}
  where = {ALGORITHMICA 9 (5): 471-494 MAY 1993}
}

@item{
  author = {HERMAN I}
  title = {THE USE OF PROJECTIVE GEOMETRY IN COMPUTER-GRAPHICS}
  where = {LECT NOTES COMPUT SC 564: R5-& 1992}
}

@item{
  author = {AGARWAL PK, SHARIR M}
  title = {APPLICATIONS OF A NEW SPACE-PARTITIONING TECHNIQUE}
  where = {DISCRETE COMPUT GEOM 9 (1): 11-38 1993}
}

@item{
  author = {PELLEGRINI M, SHOR PW}
  title = {FINDING STABBING LINES IN 3-SPACE}
  where = {DISCRETE COMPUT GEOM 8 (2): 191-208 1992}
}

@item{
  author = {PELLEGRINI M}
  title = {RAY-SHOOTING AND ISOTOPY CLASSES OF LINES IN 3-DIMENSIONAL SPACE}
  where = {LECT NOTES COMPUT SC 519: 20-31 1991}
}

@item{
  author = {AGARWAL PK, SHARIR M}
  title = {APPLICATIONS OF A NEW SPACE PARTITIONING TECHNIQUE}
  where = {LECT NOTES COMPUT SC 519: 379-391 1991}
}

# ----------------------------------------------------------------------
# SELF-VALIDATED NUMERICAL METHODS MONOGRAPH (NOT INDEXED)
#    1   STOLFI J              21 BRAZ MATH C IMAP                             1997 
#    1   STOLFI J              21 BRAZ MATH C IMPA                             1997
#    1   STOLFI J              21 BRAZ MATH C JUL                              1997
#    1   STOLFI J              AFFINE ARITHMETIC CO                                
#    1   STOLFI J              AFFINE ARITHMETIC SO                            1993
#    1   STOLFI J              MONGORAPH 21 BRAZILI                            1997
#    1   STOLFI J              P 21 BRAZ MATH C JUL                            1997
#    1   STOLFI J              SELF VALIDATED NUMER                            1997
# ----------------------------------------------------------------------

@item{
  author = {Moore R, Lodwick W}
  title = {Interval analysis and fuzzy set theory}
  where = {FUZZY SET SYST 135 (1): 5-9 APR 1 2003}
}

@item{
  author = {Vitelli M}
  title = {Range analysis in electroquasistatic field linear problems}
  where = {IEEE T DIELECT EL IN 10 (1): 155-167 FEB 2003}
}

@item{
  author = {Lopes H, Oliveira JB, de Figueiredo LH}
  title = {Robust adaptive polygonal approximation of implicit curves}
  where = {COMPUT GRAPH-UK 26 (6): 841-852 DEC 2002}
}

@item{
  author = {Hickey T, Ju Q, Van Emden MH}
  title = {Interval arithmetic: From principles to implementation}
  where = {J ACM 48 (5): 1038-1068 SEP 2001}
}

@item{
  author = {Buhler K}
  title = {Linear Interval Estimations for parametric objects theory and application}
  where = {COMPUT GRAPH FORUM 20 (3): C522-C531 2001}
}

@item{
  author = {Femia N, Spagnuolo G}
  title = {True worst-case circuit tolerance analysis using genetic algorithms and affine arithmetic}
  where = {IEEE T CIRCUITS-I 47 (9): 1285-1296 SEP 2000}
}

@item{
  author = {Femia N, Spagnuolo G}
  title = {Genetic optimization of interval arithmetic-based worst case circuit tolerance analysis}
  where = {IEEE T CIRCUITS-I 46 (12): 1441-1456 DEC 1999}
}

# ----------------------------------------------------------------------
# REVIEW OF ORIENTED PROJECTIVE GEOMETRY ? (NOT INDEXED)
#    1   STOLFI J              AM MATH MONTHLY  JUN                   479      1986 
# ----------------------------------------------------------------------

@item{
  author = {TOUSSAINT GT}
  title = {COMPUTATIONAL GEOMETRY}
  where = {P IEEE 80 (9): 1347-1363 SEP 1992 }
}

# ----------------------------------------------------------------------
# PERSONAL COMMUNICATION FROM J. STOLFI
#    1   STOLFI J              COMMUNICATION                                   1994
# ----------------------------------------------------------------------

@item{
  author = {Rubner Y, Tomasi C, Guibas LJ}
  title = {The Earth Mover's Distance as a metric for image retrieval}
  where = {INT J COMPUT VISION 40 (2): 99-121 NOV 2000 }
}

# ----------------------------------------------------------------------
# JORGE STOLFI
# ORIENTED PROJECTIVE GEOMETRY (CONFERENCE OVERVIEW)
# PROC 3rd ANNUAL ACM SYMP ON COMPUTATIONAL GEOMETRY (NOT INDEXED)
#    1   STOLFI J              MAR P ACM C COMP GEO                            1987
#    1   STOLFI J              P 3 ANN S COMP GEOM                     76      1987 
#    1   STOLFI J              P ACM C COMPUTATIONA                            1987
#    3   STOLFI J              3RD P ACM S COMP GEO                    76      1987 
# ----------------------------------------------------------------------

@item{
  author = {Fortune S}
  title = {Polyhedral modelling with multiprecision integer arithmetic}
  where = {COMPUT AIDED DESIGN 29 (2): 123-133 FEB 1997}
}

@item{
  author = {CRAPO H, PENNE R}
  title = {CHIRALITY AND THE ISOTOPY CLASSIFICATION OF SKEW LINES IN PROJECTIVE 3-SPACE}
  where = {ADV MATH 103 (1): 1-106 JAN 1994}
}

@item{
  author = {RICHTERGEBERT J}
  title = {COMBINATORIAL OBSTRUCTIONS TO THE LIFTING OF WEAVING DIAGRAMS}
  where = {DISCRETE COMPUT GEOM 10 (3): 287-312 1993}
}

@item{
  author = {GOODRICH MT, SHAUCK SB, GUHA S}
  title = {PARALLEL METHODS FOR VISIBILITY AND SHORTEST-PATH PROBLEMS IN SIMPLE POLYGONS}
  where = {ALGORITHMICA 8 (5-6): 461-486 1992}
}

@item{
  author = {GOODRICH MT, SNOEYINK JS}
  title = {STABBING PARALLEL SEGMENTS WITH A CONVEX POLYGON}
  where = {COMPUT VISION GRAPH 49 (2): 152-170 FEB 1990}
}

@item{
  author = {CLARKSON KL}
  title = {A RANDOMIZED ALGORITHM FOR CLOSEST-POINT QUERIES}
  where = {SIAM J COMPUT 17 (4): 830-847 AUG 1988}
}

----------------------------------------------------------------------