Valid HTML 4.0! Valid CSS!
%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.50",
%%%     date            = "23 May 2024",
%%%     time            = "07:08:20 MST",
%%%     filename        = "ijcga.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "40316 17020 65865 686863",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "BibTeX; bibliography; International Journal
%%%                        of Computational Geometry and Applications
%%%                        (IJCGA)",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of the International
%%%                        Journal of Computational Geometry and
%%%                        Applications (CODEN IJCAEV, ISSN 0218-1959),
%%%                        published by World Scientific.
%%%
%%%                        Publication began with volume 1, number 1, in
%%%                        March 1991, and the journal appears six times
%%%                        a year, although issues are sometimes
%%%                        combined.
%%%
%%%                        The journal has World-Wide Web sites at
%%%
%%%                            http://www.worldscientific.com/loi/ijcga
%%%                            http://ejournals.wspc.com.sg/ijcga/ijcga.shtml
%%%
%%%                        At version 1.50, the year coverage looked
%%%                        like this:
%%%
%%%                             1991 (   3)    2002 (  32)    2013 (  25)
%%%                             1992 (   4)    2003 (  29)    2014 (  22)
%%%                             1993 (   2)    2004 (  24)    2015 (  18)
%%%                             1994 (   2)    2005 (  33)    2016 (  13)
%%%                             1995 (   2)    2006 (  32)    2017 (  17)
%%%                             1996 (   0)    2007 (  29)    2018 (  19)
%%%                             1997 (  38)    2008 (  29)    2019 (  17)
%%%                             1998 (  31)    2009 (  32)    2020 (  12)
%%%                             1999 (  35)    2010 (  36)    2021 (  11)
%%%                             2000 (  36)    2011 (  36)    2022 (   8)
%%%                             2001 (  33)    2012 (  30)    2023 (  11)
%%%
%%%                             Article:        701
%%%
%%%                             Total entries:  701
%%%
%%%                        Data for the bibliography has been collected
%%%                        from the journal Web site, and the OCLC
%%%                        Article1st database, with about twenty
%%%                        additional entries from the Karlsruhe
%%%                        Computer Science bibliography archive.
%%%
%%%                        Numerous errors in the sources noted above
%%%                        have been corrected.   Spelling has been
%%%                        verified with the UNIX spell and GNU ispell
%%%                        programs using the exception dictionary
%%%                        stored in the companion file with extension
%%%                        .sok.
%%%
%%%                        BibTeX citation tags are uniformly chosen
%%%                        as name:year:abbrev, where name is the
%%%                        family name of the first author or editor,
%%%                        year is a 4-digit number, and abbrev is a
%%%                        3-letter condensation of important title
%%%                        words. Citation tags were automatically
%%%                        generated by software developed for the
%%%                        BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, using ``bibsort -byvolume''.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================
@Preamble{"\ifx \undefined \mathbb     \def \mathbb #1{{\bf #1}}\fi"}

%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:
@String{j-INT-J-COMPUT-GEOM-APPL = "International Journal of
                        Computational Geometry and Applications (IJCGA)"}

%%% ====================================================================
%%% Bibliography entries:
@Article{Hoffmann:1991:EES,
  author =       "C. M. Hoffmann and P. J. Vermeer",
  title =        "Eliminating Extraneous Solutions in Curve and Surface
                 Operations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "1",
  number =       "??",
  pages =        "47--66",
  year =         "1991",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:40:57 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Graphics/geometric.modeling.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Vanecek:1991:BIM,
  author =       "G. {Van{\v{e}}{\v{c}}ek, Jr.}",
  title =        "Brep-index: a Multidimensional Space Partitioning Tree
                 (revised)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "1",
  number =       "3",
  pages =        "243--262",
  month =        sep,
  year =         "1991",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:28:57 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Graphics/geometric.modeling.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Manocha:1991:NAS,
  author =       "Dinesh Manocha and John F. Canny",
  title =        "A New Approach to Surface Intersection",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "1",
  number =       "4",
  pages =        "491--516",
  year =         "1991",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:43:14 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Misc/rwebber.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "ftp://ftp.cs.unc.edu/pub/users/manocha/PAPERS/INTERSECT/IJCGA.pdf;
                 ftp://ftp.cs.unc.edu/pub/users/manocha/PAPERS/INTERSECT/IJCGA.ps.Z",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Sugihara:1992:VDR,
  author =       "K. Sugihara",
  title =        "{Voronoi} Diagrams in a River",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "2",
  number =       "1",
  pages =        "29--48",
  year =         "1992",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:30:10 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Graphics/geometric.modeling.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  keyword =      "Generalized Voronoi diagrams; Boat--sail distance;
                 Smallest hitting circle; Forest of cones; Plane sweep
                 algorithm",
}

@Article{Dey:1992:GTT,
  author =       "T. K. Dey and C. Bajaj",
  title =        "On Good Triangulations in Three Dimensions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "2",
  number =       "1",
  pages =        "75--95",
  year =         "1992",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:29:37 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Graphics/geometric.modeling.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Devillers:1992:RYS,
  author =       "O. Devillers",
  title =        "Randomization yields simple {$ O(n \log^* n) $}
                 algorithms for difficult {$ \Omega (n) $} problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "2",
  number =       "1",
  pages =        "97--111",
  year =         "1992",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:43:59 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Theory/ProbAlgs.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  annote =       "This paper provides two $ O(n \log^*n) $ randomized
                 algorithms. One computes the skeleton of a simple
                 polygon and the other the Delaunay triangulation of a
                 set of points knowing the Euclidean minimum spanning
                 tree. The existence of deterministic $ O(n \log n) $
                 algorithms for both problems is an open problem.",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chiang:1992:DTM,
  author =       "Y.-J. Chiang and R. Tamassia",
  title =        "Dynamization of the trapezoid method for planar point
                 location",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "2",
  number =       "??",
  pages =        "311--333",
  year =         "1992",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:45:35 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Theory/dynamic.graph.alg.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  annote =       "See also {\em 7th Symp. Comp. Geom.}, 1991, pp.
                 61--70",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chan:1993:LAN,
  author =       "{Kwong-Fai} Chan and Tak Wah Lam",
  title =        "An on-line algorithm for navigating in an unknown
                 environment",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "3",
  number =       "??",
  pages =        "227--244",
  year =         "1993",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:40:59 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Theory/online.competitive.algorithms.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Janardan:1993:MWD,
  author =       "R. Janardan",
  title =        "On maintaining the width and diameter of a planar
                 point-set online",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "3",
  number =       "??",
  pages =        "331--344",
  year =         "1993",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:46:01 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Theory/dynamic.graph.alg.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  note =         "See also {\em 2nd Int. Symp. Algorithms}, 1991, pp.
                 137--149.",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kanamaru:1994:EEG,
  author =       "Naoyoshi Kanamaru and Takao Nishizeki and Tetsuo
                 Asano",
  title =        "Efficient enumeration of grid points in a convex
                 polygon and its application to integer programming",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "4",
  number =       "1",
  pages =        "69--85",
  year =         "1994",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:36:42 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Theory/algobib.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  keywords =     "Integer Chebyshev polynomials",
}

@Article{Sugihara:1994:RTO,
  author =       "Kokichi Sugihara and Masao Iri",
  title =        "A Robust Topology-Oriented Incremental Algorithm for
                 {Voronoi} Diagrams",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "4",
  number =       "2",
  pages =        "179--228",
  month =        jun,
  year =         "1994",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Math/auto.diff.bib;
                 ftp://ftp.ira.uka.de/bibliography/Misc/rwebber.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fortune:1995:NSA,
  author =       "S. J. Fortune",
  title =        "Numerical Stability of Algorithms for {$2$D}
                 {Delaunay} triangulations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "5",
  number =       "??",
  pages =        "193--213",
  year =         "1995",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:33:01 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Misc/att.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Teng:1995:PAV,
  author =       "Y. A. Teng and D. Mount and E. Puppo and L. S. Davis",
  title =        "Parallelizing an algorithm for visibility on
                 polyhedral terrain",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  year =         "1995",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:28:25 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Graphics/genova.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  topic =        "visibility",
}

@Article{Arkin:1997:GEF,
  author =       "Esther M. Arkinn and Joseph S. B. Mitchell and Steven
                 S. Skiena",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "1--2",
  pages =        "1--??",
  month =        feb # "--" # apr,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:53 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mitchell:1997:FCT,
  author =       "Scott A. Mitchell",
  title =        "Finding a Covering Triangulation Whose Maximum Angle
                 is Provably Small",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "1--2",
  pages =        "5--??",
  month =        feb # "--" # apr,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:53 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Shapiro:1997:MGR,
  author =       "Vadim Shapiro",
  title =        "Maintenance of Geometric Representations Through Space
                 Decompositions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "1--2",
  pages =        "21--??",
  month =        feb # "--" # apr,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:53 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  note =         "See erratum \cite{Shapiro:1997:EMG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kedem:1997:EBR,
  author =       "Klara Kedem and Daniel Cohen",
  title =        "Efficient Bitmap Resemblance Under Translations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "1--2",
  pages =        "57--??",
  month =        feb # "--" # apr,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:53 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Teng:1997:PAV,
  author =       "Y. Ansel Teng and David Mount and Enrico Puppo and
                 Larry S. Davis",
  title =        "Parallelizing an Algorithm for Visibility on
                 Polyhedral Terrain",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "1--2",
  pages =        "75--??",
  month =        feb # "--" # apr,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:53 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chiang:1997:OSP,
  author =       "Yi-Jen Chiang and Roberto Tamassia",
  title =        "Optimal Shortest Path and Minimum --- Link Path
                 Queries between Two Convex Polygons inside a Simple
                 Polygonal Obstacle",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "1--2",
  pages =        "85--??",
  month =        feb # "--" # apr,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:53 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lin:1997:ECD,
  author =       "Ming Lin and Dinesh Manocha",
  title =        "Efficient Contact Determination in Dynamic
                 Environments",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "1--2",
  pages =        "123--??",
  month =        feb # "--" # apr,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:53 MST 2004",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Graphics/geometric.modeling.bib;
                 http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:1997:FP,
  author =       "Prosenjit Bose and Leonidas Guibas and Anna Lubiw and
                 Mark Overmars and Diane Souvaine and Jorge Urrutia",
  title =        "The Floodlight Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "1--2",
  pages =        "153--163",
  month =        feb # "--" # apr,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:53 MST 2004",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Graphics/rad.bib;
                 http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  keywords =     "Illumination Problems, Dissecting Point Sets",
  xxtitle =      "The Floodlighting Problem",
}

@Article{ORourke:1997:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column $ 30 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "1--2",
  pages =        "165--??",
  month =        feb # "--" # apr,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:53 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dey:1997:EAD,
  author =       "Tamal K. Dey",
  title =        "Efficient Algorithms to Detect Null-Homologous Cycles
                 on $2$-Manifolds",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "3",
  pages =        "167--??",
  month =        jun,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{deBerg:1997:SAN,
  author =       "Mark de Berg and Dan Halperin and Mark Overmars and
                 Marc van Kreveld",
  title =        "Sparse Arrangements and the Number of Views of
                 Polyhedral Scenes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "3",
  pages =        "175--??",
  month =        jun,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kant:1997:MCV,
  author =       "Goos Kant",
  title =        "A More Compact Visibility Representation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "3",
  pages =        "197--??",
  month =        jun,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chrobak:1997:CGD,
  author =       "Marek Chrobak and Goos Kant",
  title =        "Convex Grid Drawings of $3$-Connected Planar Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "3",
  pages =        "211--??",
  month =        jun,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hert:1997:PCR,
  author =       "Susan Hert and Vladimir Lumelsky",
  title =        "Planar Curve Routing for Tethered-Robot Motion
                 Planning",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "3",
  pages =        "225--??",
  month =        jun,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Zhu:1997:ACP,
  author =       "Binhai Zhu",
  title =        "Approximating Convex Polyhedra with Axis-Parallel
                 Boxes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "3",
  pages =        "253--??",
  month =        jun,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fortune:1997:EF,
  author =       "Steven Fortune",
  title =        "{Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "4",
  pages =        "269--??",
  month =        aug,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Choi:1997:AES,
  author =       "Joonsoo Choi and Juergen Sellen and Chee-Keng Yap",
  title =        "Approximate {Euclidean} Shortest Paths in $3$-Space",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "4",
  pages =        "271--??",
  month =        aug,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Das:1997:FAC,
  author =       "Gautam Das and Giri Narasimhan",
  title =        "A Fast Algorithm for Constructing Sparse {Euclidean}
                 Spanners",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "4",
  pages =        "297--??",
  month =        aug,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mitchell:1997:QSR,
  author =       "Joseph S. B. Mitchell and David M. Mount and Subhash
                 Suri",
  title =        "Query-Sensitive Ray Shooting",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "4",
  pages =        "317--??",
  month =        aug,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aichholzer:1997:MSR,
  author =       "Oswin Aichholzer and Helmut Alt and G{\"u}nter Rote",
  title =        "Matching Shapes with a Reference Point",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "4",
  pages =        "349--??",
  month =        aug,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Edelsbrunner:1997:TTS,
  author =       "Herbert Edelsbrunner and Nimish R. Shah",
  title =        "Triangulating Topological Spaces",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "4",
  pages =        "365--??",
  month =        aug,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:1997:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column $ 31 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "4",
  pages =        "379--??",
  month =        aug,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Shapiro:1997:EMG,
  author =       "Vadim Shapiro",
  title =        "Errata: {``Maintenance of Geometric Representations
                 Through Space Decompositions''}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "4",
  pages =        "383--??",
  month =        aug,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:54 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  note =         "See \cite{Shapiro:1997:MGR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Takahashi:1997:SNC,
  author =       "Jun-Ya Takahashi and Hitoshi Suzuki and Takao
                 Nishizeki",
  title =        "Shortest Non-Crossing Rectilinear Paths in Plane
                 Regions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "5",
  pages =        "419--??",
  month =        oct,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gupta:1997:REP,
  author =       "Prosenjit Gupta and Ravi Janardan and Michiel Smid and
                 Bhaskar Dasgupta",
  title =        "The Rectangle Enclosure and Point-Dominance Problems
                 Revisited",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "5",
  pages =        "437--??",
  month =        oct,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ganley:1997:ICO,
  author =       "Joseph L. Ganley and J. P. Cohoon",
  title =        "Improved Computation of Optimal Rectilinear {Steiner}
                 Minimal Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "5",
  pages =        "457--??",
  month =        oct,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Theory/Steiner.bib;
                 http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "An $ O(n 3^n) $ algorithm and an $ O(n^2 2.62^n) $
                 algorithm for computing optimal rectilinear Steiner
                 trees",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Keil:1997:COP,
  author =       "J. Mark Keil",
  title =        "Covering Orthogonal Polygons with Non-Piercing
                 Rectangles",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "5",
  pages =        "473--??",
  month =        oct,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Eppstein:1997:FCP,
  author =       "David Eppstein",
  title =        "Faster Circle Packing with Application to Nonobtuse
                 Triangulation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "5",
  pages =        "485--??",
  month =        oct,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Alsuwaiyel:1997:TAS,
  author =       "Muhammad H. Alsuwaiyel",
  title =        "Two Algorithms for the Sum of Diameters Problem and a
                 Related Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "5",
  pages =        "493--??",
  month =        oct,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:1997:CGCc,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column $ 32 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "5",
  pages =        "509--??",
  month =        oct,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cai:1997:CVI,
  author =       "Leizhen Cai and J. Mark Keil",
  title =        "Computing Visibility Information in an Inaccurate
                 Simple Polygon",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "6",
  pages =        "515--??",
  month =        dec,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kantabutra:1997:RPU,
  author =       "Vitit Kantabutra",
  title =        "Reaching a Point with an Unanchored Robot Arm in a
                 Square",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "6",
  pages =        "539--??",
  month =        dec,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Czyzowicz:1997:STP,
  author =       "Jurek Czyzowicz and Hazel Everett and Jean-Marc
                 Robert",
  title =        "Separating Translates in the Plane: Combinatorial
                 Bounds and an Algorithm",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "6",
  pages =        "551--??",
  month =        dec,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Follert:1997:CLE,
  author =       "Frank Follert and Elmar Sch{\"o}mer and J{\"u}rgen
                 Sellen and Michiel Smid and Christian Thiel",
  title =        "Computing a Largest Empty Anchored Cylinder, and
                 Related Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "6",
  pages =        "563--??",
  month =        dec,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lee:1997:FRP,
  author =       "D. T. Lee and C. D. Yang and C. K. Wong",
  title =        "Finding Rectilinear Paths Among Obstacles in a
                 Two-Layer Interconnection Model",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "6",
  pages =        "581--??",
  month =        dec,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wang:1997:RQP,
  author =       "Wenping Wang and Barry Joe and Ronald Goldman",
  title =        "Rational Quadratic Parameterizations of Quadrics",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "6",
  pages =        "599--??",
  month =        dec,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:1997:AI,
  author =       "Anonymous",
  title =        "Author Index",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "7",
  number =       "6",
  pages =        "621--??",
  month =        dec,
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:55 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fekete:1997:HDS,
  author =       "S. P. Fekete and J. S. B. Mitchell",
  title =        "Histogram decomposition and stereolithography",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  year =         "1997",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Feb 25 07:33:35 2002",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Techreports/ZPR.Koeln.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  annote =       "A polyhedral solid model can be constructed by the
                 process of stereolithography if it has a facet so that
                 all points of the model can see this facet, in the
                 direction orthogonal to it; such a polyhedron is a
                 histogram. In stereolithography, or other forms of
                 layered manufacturing, one may want to decompose a
                 model into a small number of histograms. In this note,
                 we provide the first algorithmic results on the
                 histogram decomposition problem, proving that it is
                 NP-complete to decide if a model can be decomposed into
                 k histograms, if the model is either a polygonal region
                 (with holes) in the plane, or a solid polyhedral model
                 of genus 0.",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  keywords =     "68Q25, 68U05, 90C28, 90C39; computational geometry,
                 NP-completeness, complexity, dynamic programming,
                 3-dimensional geometry, surface decomposition,
                 histograms, terrains, stereolithography, manufacturing
                 processes, NC-machining, visibility",
  xxnote =       "Submitted. Was this published??",
}

@Article{Goodrich:1998:IRS,
  author =       "Michael T. Goodrich",
  title =        "An Improved Ray Shooting Method for Constructive Solid
                 Geometry Models Via Tree Contraction",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "1",
  pages =        "1--??",
  month =        feb,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:56 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Abello:1998:IOP,
  author =       "James Abello and Vladimir Estivill-Castro and Thomas
                 Shermer and Jorge Urrutia",
  title =        "Illumination of Orthogonal Polygons with Orthogonal
                 Floodlights",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "1",
  pages =        "25--??",
  month =        feb,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:56 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Nielsen:1998:OSC,
  author =       "Franck Nielsen and Mariette Yvinec",
  title =        "An Output-Sensitive Convex Hull Algorithm for Planar
                 Objects",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "1",
  pages =        "39--??",
  month =        feb,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:56 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fjallstrom:1998:ERS,
  author =       "Per-Olof Fj{\"a}llstr{\"o}m and Jan Petersson and
                 Larsgunnar Nilsson and Zhi-Hua Zhong",
  title =        "Evaluation of Range Searching Methods for Contact
                 Searching in Mechanical Engineering",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "1",
  pages =        "67--??",
  month =        feb,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:56 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tseng:1998:TGW,
  author =       "L. H. Tseng and P. Heffernan and D. T. Lee",
  title =        "Two-Guard Walkability of Simple Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "1",
  pages =        "85--??",
  month =        feb,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:56 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Amenta:1998:GEF,
  author =       "Nina Amenta and Steven Fortune",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "2",
  pages =        "117--??",
  month =        apr,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lee:1998:GDV,
  author =       "D. T. Lee and Chin-Fang Shen and Dennis S. Sheu",
  title =        "{Geosheet}: a Distributed Visualization Tool for
                 Geometric Algorithms",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "2",
  pages =        "119--??",
  month =        apr,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Guibas:1998:RAD,
  author =       "Leonidas J. Guibas and David H. Marimont",
  title =        "Rounding Arrangements Dynamically",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "2",
  pages =        "157--??",
  month =        apr,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Guibas:1998:PAP,
  author =       "Leonidas J. Guibas and Dan Halperin and Hirohisa
                 Hirukawa and Jean-Claude Latombe and Randall H.
                 Wilson",
  title =        "Polyhedral Assembly Partitioning Using Maximally
                 Covered Cells in Arrangements of Convex Polytopes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "2",
  pages =        "179--??",
  month =        apr,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Vleugels:1998:AVD,
  author =       "Jules Vleugels and Mark Overmars",
  title =        "Approximating {Voronoi} Diagrams of Convex Sites in
                 Any Dimension",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "2",
  pages =        "201--??",
  month =        apr,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Emiris:1998:CIC,
  author =       "Ioannis Z. Emiris",
  title =        "A Complete Implementation for Computing General
                 Dimensional Convex Hulls",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "2",
  pages =        "223--??",
  month =        apr,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mucke:1998:RIT,
  author =       "Ernst P. M{\"u}cke",
  title =        "A Robust Implementation for Three-Dimensional
                 {Delaunay} Triangulations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "2",
  pages =        "255--??",
  month =        apr,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:1998:DWV,
  author =       "Danny Z. Chen",
  title =        "Determining Weak Visibility of a Polygon from an Edge
                 in Parallel",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "3",
  pages =        "277--??",
  month =        jun,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:1998:FCH,
  author =       "Wei Chen and Koichi Wada and Kimio Kawaguchi and Danny
                 Z. Chen",
  title =        "Finding the Convex Hull of Discs in Parallel",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "3",
  pages =        "305--??",
  month =        jun,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Devillers:1998:DBP,
  author =       "Olivier Devillers and Mordecai J. Golin",
  title =        "Dog Bites Postman: Point Location in the Moving
                 {Voronoi} Diagram and Related Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "3",
  pages =        "321--??",
  month =        jun,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Arkin:1998:DTG,
  author =       "Esther M. Arkin and Henk Meijer and Joseph S. B.
                 Mitchell and David Rappaport and Steven S. Skiena",
  title =        "Decision Trees for Geometric Models",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "3",
  pages =        "343--??",
  month =        jun,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Albers:1998:VDM,
  author =       "Gerhard Albers and Leonidas J. Guibas and Joseph S. B.
                 Mitchell and Thomas Roos",
  title =        "{Voronoi} Diagrams of Moving Points",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "3",
  pages =        "365--??",
  month =        jun,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:1998:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column $ 33 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "3",
  pages =        "381--??",
  month =        jun,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:57 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lin:1998:GEF,
  author =       "Ming C. Lin and Dinesh Manocha",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "4",
  pages =        "385--??",
  month =        aug,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hong:1998:TBC,
  author =       "Mu Hong and Thomas W. Sederberg and Krzysztof S.
                 Klimaszewski and Kazufumi Kaneda",
  title =        "Triangulation of Branching Contours Using Area
                 Minimization",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "4",
  pages =        "389--??",
  month =        aug,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Petitjean:1998:CGA,
  author =       "Sylvain Petitjean",
  title =        "A Computational Geometric Approach to Visual Hulls",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "4",
  pages =        "407--??",
  month =        aug,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hert:1998:PAD,
  author =       "Susan Hert and Vladimir Lumelsky",
  title =        "Polygon Area Decomposition for Multiple-Robot
                 Workspace Division",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "4",
  pages =        "437--??",
  month =        aug,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{DeBerg:1998:CAT,
  author =       "Mark {De Berg} and Henk Meijer and Mark Overmars and
                 Gordon Wilfong",
  title =        "Computing the Angularity Tolerance",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "4",
  pages =        "467--??",
  month =        aug,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Jabbour:1998:DRA,
  author =       "Toni Jabbour and Christian Mascle and Roland
                 Maranzana",
  title =        "A Database for the Representation of Assembly Features
                 in Mechanical Products",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "5--6",
  pages =        "483--??",
  month =        oct # "--" # dec,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ensz:1998:IMG,
  author =       "Mark T. Ensz and Duane W. Storti and Mark A. Ganter",
  title =        "Implicit Methods for Geometry Creation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "5--6",
  pages =        "509--??",
  month =        oct # "--" # dec,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Menon:1998:FFM,
  author =       "Jai Menon and Baining Guo",
  title =        "Free-Form Modeling in Bilateral {Brep} and {CSG}
                 Representation Schemes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "5--6",
  pages =        "537--??",
  month =        oct # "--" # dec,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Evans:1998:SCM,
  author =       "Guy Evans and Alan Middleditch and Nick Miles",
  title =        "Stable Computation of the {$2$D} Medial Axis
                 Transform",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "5--6",
  pages =        "577--??",
  month =        oct # "--" # dec,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Farouki:1998:SPC,
  author =       "Rida T. Farouki and Rajesh Ramamurthy",
  title =        "Specified-Precision Computation of Curve\slash Curve
                 Bisectors",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "5--6",
  pages =        "599--??",
  month =        oct # "--" # dec,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Barequet:1998:DPD,
  author =       "Gill Barequet",
  title =        "{DCEL}: a Polyhedral Database and Programming
                 Environment",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "5--6",
  pages =        "619--??",
  month =        oct # "--" # dec,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Agarwal:1998:CGC,
  author =       "Pankaj K. Agarwal and Joseph O'Rourke",
  title =        "Computational Geometry Column $ 34 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "5--6",
  pages =        "637--??",
  month =        oct # "--" # dec,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:1998:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 8 (1998)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "8",
  number =       "5--6",
  pages =        "643--??",
  month =        oct # "--" # dec,
  year =         "1998",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:58 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fekete:1999:RBV,
  author =       "S. P. Fekete and H. Meijer",
  title =        "Rectangle and Box Visibility Graphs in {$3$D}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "1",
  pages =        "1--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:59 MST 2004",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Techreports/ZPR.Koeln.bib;
                 http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  annote =       "We discuss rectangle and box visibility
                 representations of graphs in 3-dimensional space. In
                 these representations, vertices are represented by
                 axis-aligned disjoint rectangles or boxes. <br> Two
                 vertices are adjacent if and only if their
                 corresponding boxes see each other along a small
                 axis-parallel cylinder. We concentrate on lower and
                 upper bounds for the size of the largest complete graph
                 that can be represented. In particular, we examine
                 these bounds under certain restrictions: What can be
                 said if we may only use boxes of a limited number of
                 shapes? <br> Some of the results presented are as
                 follows:<br> There is a representation of K<sub>8</sub>
                 by unit boxes.<br> There is no representation of
                 K<sub>10</sub> by unit boxes.<br> There is a
                 representation of K<sub>56</sub>, using 6 different box
                 shapes.<br> There is no representation of
                 K<sub>184</sub> by general boxes. <p> A special case
                 arises for rectangle visibility graphs, where no two
                 boxes can see each other in the x- or y-directions,
                 which means that the boxes have to see each other in
                 z-parallel direction. This special case has been
                 considered before; we give further results, dealing
                 with the aspects arising from limits on the number of
                 shapes.",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  keywords =     "05C10, 05C75, 68R05,68R10; graph representation,
                 visibility, graph drawing, 3-dimensional geometry",
}

@Article{Atallah:1999:IHB,
  author =       "M. J. Atallah",
  title =        "An Improved Hypercube Bound for Multisearching and Its
                 Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "1",
  pages =        "29--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:59 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Devillers:1999:OLB,
  author =       "O. Devillers and M. J. Katz",
  title =        "Optimal Line Bipartitions of Point Sets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "1",
  pages =        "39--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:59 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kirkpatrick:1999:CCS,
  author =       "D. Kirkpatrick and J. Snoeyink",
  title =        "Computing Constrained Shortest Segments: Butterfly
                 Wingspans in Logarithmic Time",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "1",
  pages =        "53--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:59 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tan:1999:EGS,
  author =       "X. H. Tan",
  title =        "Edge Guards in Straight Walkable Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "1",
  pages =        "63--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:59 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bhattacharya:1999:CSW,
  author =       "B. K. Bhattacharya and A. Mukhopadhyay and G. T.
                 Toussaint",
  title =        "Computing a Shortest Weakly Externally Visible Line
                 Segment for a Simple Polygon",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "1",
  pages =        "81--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:59 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Smid:1999:WRS,
  author =       "M. Smid and R. Janardan",
  title =        "On the Width and Roundness of a Set of Points in the
                 Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "1",
  pages =        "97--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:59 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Glozman:1999:CDR,
  author =       "A. Glozman and K. Kedem and G. Shpitalnik",
  title =        "Computing a Double-Ray Center for a Planar Point Set",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "2",
  pages =        "109--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Shapiro:1999:WFS,
  author =       "V. Shapiro",
  title =        "Well-Formed Set Representations of Solids",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "2",
  pages =        "125--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kusakari:1999:SPP,
  author =       "Y. Kusakari and H. Suzuki and T. Nishizeki",
  title =        "A Shortest Pair of Paths on the Plane with Obstacles
                 and Crossing Areas",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "2",
  pages =        "151--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kranakis:1999:ITS,
  author =       "E. Kranakis and J. Urrutia",
  title =        "Isomorphic Triangulations with Small Number of
                 {Steiner} Points",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "2",
  pages =        "171--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Czyzowicz:1999:IS,
  author =       "J. Czyzowicz and I. Stojmenovic and J. Urrutia",
  title =        "Immobilizing a Shape",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "2",
  pages =        "181--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Grove:1999:OCM,
  author =       "E. F. Grove and T. M. Murali and J. S. Vitter",
  title =        "The Object Complexity Model for Hidden-Surface
                 Removal",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "2",
  pages =        "207--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Segal:1999:PSA,
  author =       "M. Segal",
  title =        "On Piercing Sets of Axis-Parallel Rectangles and
                 Rings",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "3",
  pages =        "219--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aichholzer:1999:SVD,
  author =       "O. Aichholzer and F. Aurenhammer and D. Z. Chen and D.
                 T. Lee and E. Papadopoulou",
  title =        "Skew {Voronoi} Diagrams",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "3",
  pages =        "235--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Assa:1999:PDB,
  author =       "E. Assa and M. J. Katz",
  title =        "$3$-Piercing of $d$-Dimensional Boxes and Homothetic
                 Triangles",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "3",
  pages =        "249--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Narasimhan:1999:HTS,
  author =       "G. Narasimhan",
  title =        "On {Hamiltonian} Triangulations in Simple Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "3",
  pages =        "261--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Richards:1999:MST,
  author =       "D. Richards and J. S. Salowe",
  title =        "Mixed Spanning Trees in Theory and Practice",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "3",
  pages =        "277--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Baek:1999:CTS,
  author =       "N. Baek and S.-Y. Shin and K.-Y. Chwa",
  title =        "On Computing Translational Swept Volumes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "3",
  pages =        "293--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tan:1999:CSI,
  author =       "X. Tan and T. Hirata and Y. Inagaki",
  title =        "Corrigendum to {``An Incremental Algorithm for
                 Constructing Shortest Watchman Routes''}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "3",
  pages =        "319--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:00 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Agarwal:1999:GEF,
  author =       "Pankaj K. Agarwal",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "4--5",
  pages =        "325--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:01 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bernardini:1999:ARC,
  author =       "Fausto Bernardini and Chandrajit L. Bajaj and Jindong
                 Chen and Daniel R. Schikore",
  title =        "Automatic Reconstruction of {$3$D CAD} Models From
                 Digital Scans",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "4--5",
  pages =        "327--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:01 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Goldwasser:1999:CMA,
  author =       "Michael H. Goldwasser and Rajeev Motwani",
  title =        "Complexity Measures for Assembly Sequences",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "4--5",
  pages =        "371--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:01 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bridgeman:1999:GDT,
  author =       "Stina Bridgeman and Ashim Garg and Roberto Tamassia",
  title =        "A Graph Drawing and Translation Service on the {World
                 Wide Web}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "4--5",
  pages =        "419--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:01 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Choset:1999:NAC,
  author =       "Howie Choset",
  title =        "Nonsmooth Analysis, Convex Analysis, and their
                 Applications to Motion Planning",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "4--5",
  pages =        "447--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:01 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Guibas:1999:VBP,
  author =       "Leonidas J. Guibas and Jean-Claude Latombe and Steven
                 M. Lavalle and David Lin and Rajeev Motwani",
  title =        "A Visibility-Based Pursuit-Evasion Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "4--5",
  pages =        "471--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:01 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hsu:1999:PPE,
  author =       "David Hsu and Jean-Claude Latombe and Rajeev Motwani",
  title =        "Path Planning in Expansive Configuration Spaces",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "4--5",
  pages =        "495--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:01 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:1999:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column $ 35 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "4--5",
  pages =        "513--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:01 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bern:1999:PCQ,
  author =       "M. Bern and D. Eppstein and S.-H. Teng",
  title =        "Parallel Construction of Quadtrees and Quality
                 Triangulations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "6",
  pages =        "517--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:02 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Papadopoulou:1999:PNC,
  author =       "E. Papadopoulou",
  title =        "$k$-Pairs Non-Crossing Shortest Paths in a Simple
                 Polygon",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "6",
  pages =        "533--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:02 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{DAmore:1999:IPS,
  author =       "F. D'Amore and R. Giaccio",
  title =        "Intersection Problems on Segments Under Boundary
                 Updates with Application to Persistent Lists",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "6",
  pages =        "553--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:02 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Miller:1999:DGG,
  author =       "G. L. Miller and D. Talmor and S.-H. Teng",
  title =        "Data Generation for Geometric Algorithms on
                 Non-Uniform Distributions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "6",
  pages =        "577--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:02 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Martini:1999:MNP,
  author =       "H. Martini and V. Soltan",
  title =        "Minimum Number of Pieces in a Convex Partition of a
                 Polygonal Domain",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "6",
  pages =        "599--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:02 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:1999:CGCb,
  author =       "J. O'Rourke",
  title =        "Computational Geometry Column $ 36 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "6",
  pages =        "615--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:02 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:1999:AI,
  author =       "Anonymous",
  title =        "Author Index",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "9",
  number =       "6",
  pages =        "619--??",
  year =         "1999",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:19:02 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Muller-Hannemann:2000:QRC,
  author =       "M. M{\"u}ller-Hannemann and K. Weihe",
  title =        "Quadrangular Refinements of Convex Polygons with an
                 Application to Finite-Element Meshes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "1",
  pages =        "1--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Boissonnat:2000:CLC,
  author =       "J.-D. Boissonnat and J. Czyzowicz and O. Devillers and
                 J. Urrutia and M. Yvinec",
  title =        "Computing Largest Circles Separating Two Sets of
                 Segments",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "1",
  pages =        "41--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bremner:2000:PVG,
  author =       "D. Bremner and T. Shermer",
  title =        "Point Visibility Graphs and {$O$}-Convex Cover",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "1",
  pages =        "55--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kaneko:2000:AHC,
  author =       "A. Kaneko and M. Kano and K. Yoshimoto",
  title =        "Alternating {Hamilton} Cycles with Minimum Number of
                 Crossings in the Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "1",
  pages =        "73--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Srinivasaraghavan:2000:OEV,
  author =       "G. Srinivasaraghavan and A. Mukhopadhyay",
  title =        "Orthogonal Edge Visibility Graphs of Polygons with
                 Holes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "1",
  pages =        "79--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Demaine:2000:CGC,
  author =       "E. D. Demaine and J. O'Rourke",
  title =        "Computational Geometry Column $ 37 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "1",
  pages =        "103--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ratschek:2000:EOC,
  author =       "H. Ratschek and J. Rokne",
  title =        "Exact and Optimal Convex Hulls in {$2$D}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "2",
  pages =        "109--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Baek:2000:TDT,
  author =       "N. Baek and S.-Y. Shin and K.-Y. Chwa",
  title =        "Three-Dimensional Topological Sweep for Computing
                 Rotational Swept Volumes of Polyhedral Objects",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "2",
  pages =        "131--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aleksandrov:2000:AFS,
  author =       "L. G. Aleksandrov and H. N. Djidjev and J.-R. Sack",
  title =        "An {$ O(n \log n) $} Algorithm for Finding a Shortest
                 Central Link Segment",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "2",
  pages =        "157--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wismath:2000:PLS,
  author =       "S. K. Wismath",
  title =        "Point and Line Segment Reconstruction from Visibility
                 Information",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "2",
  pages =        "189--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lee:2000:SPR,
  author =       "J.-H. Lee and S.-M. Park and K.-Y. Chwa",
  title =        "Searching a Polygonal Room with One Door by a
                 $1$-Searcher",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "2",
  pages =        "201--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:2000:CGCa,
  author =       "J. O'Rourke",
  title =        "Computational Geometry Column $ 38 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "2",
  pages =        "221--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:41 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Teng:2000:GEF,
  author =       "S.-H. Teng",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "3",
  pages =        "225--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Teng:2000:UMG,
  author =       "S.-H. Teng and C. W. Wong",
  title =        "Unstructured Mesh Generation: Theory, Practice, and
                 Perspectives",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "3",
  pages =        "227--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Edelsbrunner:2000:ASG,
  author =       "H. Edelsbrunner and R. Waupotitsch",
  title =        "Adaptive Simplicial Grids from Cross-Sections of
                 Monotone Complexes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "3",
  pages =        "267--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Muller-Hannemann:2000:HQQ,
  author =       "M. M{\"u}ller-Hannemann",
  title =        "High Quality Quadrilateral Surface Meshing Without
                 Template Restrictions: a New Approach Based on Network
                 Flow Techniques",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "3",
  pages =        "285--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Sheffer:2000:VTO,
  author =       "A. Sheffer and M. Bercovier and T. Blacker and J.
                 Clements",
  title =        "Virtual Topology Operators for Meshing",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "3",
  pages =        "309--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Berzins:2000:SBM,
  author =       "M. Berzins",
  title =        "Solution-Based Mesh Quality Indicators for Triangular
                 and Tetrahedral Meshes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "3",
  pages =        "333--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bern:2000:QMC,
  author =       "M. Bern and D. Eppstein",
  title =        "Quadrilateral Meshing by Circle Packing",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "4",
  pages =        "347--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Freitag:2000:CBA,
  author =       "L. A. Freitag and C. Ollivier-Gooch",
  title =        "A Cost\slash Benefit Analysis of Simplicial Mesh
                 Improvement Techniques as Measured by Solution
                 Efficiency",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "4",
  pages =        "361--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Schneiders:2000:OBH,
  author =       "R. Schneiders",
  title =        "Octree-Based Hexahedral Mesh Generation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "4",
  pages =        "383--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mitchell:2000:HFI,
  author =       "S. A. Mitchell",
  title =        "High Fidelity Interval Assignment",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "4",
  pages =        "399--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Shimada:2000:ATP,
  author =       "K. Shimada and A. Yamada and T. Itoh",
  title =        "Anisotropic Triangulation of Parametric Surfaces via
                 Close Packing of Ellipsoids",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "4",
  pages =        "417--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:2000:CGCb,
  author =       "J. O'Rourke",
  title =        "Computational Geometry Column $ 39 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "4",
  pages =        "441--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:42 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lopez:2000:EAC,
  author =       "M. A. Lopez and S. Reisner",
  title =        "Efficient Approximation of Convex Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "5",
  pages =        "445--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:43 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ODunlaing:2000:HCE,
  author =       "C. {{\'O} D{\'u}nlaing} and C. Watt and D. Wilkins",
  title =        "Homeomorphism of $2$-Complexes is Equivalent to Graph
                 Isomorphism",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "5",
  pages =        "453--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:43 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{DeMeneses:2000:ESR,
  author =       "C. N. {De Meneses} and C. C. {De Souza}",
  title =        "Exact Solutions of Rectangular Partitions via Integer
                 Programming",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "5",
  pages =        "477--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:43 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bespamyatnikh:2000:OFL,
  author =       "S. Bespamyatnikh and K. Kedem and M. Segal and A.
                 Tamir",
  title =        "Optimal Facility Location Under Various Distance
                 Functions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "5",
  pages =        "523--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:43 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Keil:2000:VSD,
  author =       "M. Keil and D. M. Mount and S. K. Wismath",
  title =        "Visibility Stabs and Depth-First Spiralling on Line
                 Segments in Output Sensitive Time",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "5",
  pages =        "535--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:43 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Biedl:2000:TPM,
  author =       "T. C. Biedl and B. P. Madden and I. G. Tollis",
  title =        "The Three-Phase Method: a Unified Approach to
                 Orthogonal Graph Drawing",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "6",
  pages =        "553--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ben-Moshe:2000:OFL,
  author =       "B. Ben-Moshe and M. J. Katz and M. Segal",
  title =        "Obnoxious Facility Location: Complete Service with
                 Minimal Harm",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "6",
  pages =        "581--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mount:2000:QAR,
  author =       "D. M. Mount and N. S. Netanyahu and C. D. Piatko and
                 R. Silverman and A. Y. Wu",
  title =        "Quantile Approximation for Robust Statistical
                 Estimation and $k$-Enclosing Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "6",
  pages =        "593--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Andersson:2000:ETF,
  author =       "L.-E. Andersson and T. J. Peters and N. F. Stewart",
  title =        "Equivalence of Topological Form for Curvilinear
                 Geometric Objects",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "6",
  pages =        "609--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{DiBattista:2000:DDA,
  author =       "G. {Di Battista} and A. Garg and G. Liotta and A.
                 Parise and R. Tamassia and E. Tassinari and F. Vargiu
                 and L. Vismara",
  title =        "Drawing Directed Acyclic Graphs: An Experimental
                 Study",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "6",
  pages =        "623--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:2000:CGCc,
  author =       "J. O'Rourke",
  title =        "Computational Geometry Column $ 40 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "6",
  pages =        "649--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2000:AI,
  author =       "Anonymous",
  title =        "Author Index",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "10",
  number =       "6",
  pages =        "653--??",
  year =         "2000",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Pajarola:2001:VGC,
  author =       "Renato Pajarola and Peter Widmayer",
  title =        "Virtual Geoexploration: Concepts and Design Choices",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "1",
  pages =        "1--14",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Renato Pajarola and Peter Widmayer and J.-D.
                 Boissonnat",
}

@Article{Tamassia:2001:CSA,
  author =       "Roberto Tamassia and Luca Vismara",
  title =        "A Case Study in Algorithm Engineering for Geometric
                 Computing",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "1",
  pages =        "15--70",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Roberto Tamassia and Luca Vismara and J.-D.
                 Boissonnat",
}

@Article{Aoki:2001:TWB,
  author =       "Kiyoko F. Aoki and D. T. Lee",
  title =        "Towards {Web}-Based Computing",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "1",
  pages =        "71--104",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Kiyoko F. Aoki and D. T. Lee and J.-D. Boissonnat",
}

@Article{Krishnan:2001:BBE,
  author =       "S. Krishnan and D. Manocha and M. Gopi and T. Culver
                 and J. Keyser",
  title =        "{BOOLE}: a Boundary Evaluation System for {Boolean}
                 Combinations of Sculptured Solids",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "1",
  pages =        "105--??",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:44 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Asano:2001:EAO,
  author =       "Tetsuo Asano and Danny Z. Chen and Naoki Katoh and T.
                 Tokuyama",
  title =        "Efficient Algorithms for Optimization-Based Image
                 Segmentation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "2",
  pages =        "145--166",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kim:2001:LRM,
  author =       "Sung Kwon Kim and Chan-Su Shin and Tae-Cheon Yang and
                 others",
  title =        "Labeling a Rectilinear Map with Sliding Labels",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "2",
  pages =        "167--179",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Theory/map.labeling.bib;
                 http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Sung Kwon Kim and Chan-Su Shin and Tae-Cheon Yang and
                 others",
}

@Article{Strijk:2001:LPC,
  author =       "Tycho Strijk and Alexander Wolff",
  title =        "Labeling Points with Circles",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "2",
  pages =        "181--195",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Misc/rwebber.bib;
                 ftp://ftp.ira.uka.de/bibliography/Theory/map.labeling.bib;
                 http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  URL =          "http://ejournals.wspc.com.sg/journals/ijcga/11/preserved-docs/1102/S0218195901000444.pdf;
                 http://www.math-inf.uni-greifswald.de/map-labeling/papers/sw-lpc-01.ps.gz",
  abstract =     "We present a new algorithm for labeling points with
                 circles of equal size. Our algorithm tries to maximize
                 the label size. It improves the approximation factor of
                 the only known algorithm for this problem by more than
                 50\% to about $ 1 / 20 $. At the same time, our
                 algorithm keeps the $ O(n \log n) $ time bound of its
                 predecessor. In addition, we show that the decision
                 problem is NP-hard and that it is NP-hard to
                 approximate the maximum label size beyond a certain
                 constant factor.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Tycho Strijk and Alexander Wolff and J. S. B.
                 Mitchell",
}

@Article{Cheong:2001:RPD,
  author =       "Otfried Cheong and Ren{\'e} van Oostrum",
  title =        "Reaching a Polygon with Directional Uncertainty",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "2",
  pages =        "197--214",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Otfried Cheong and Ren{\'e} van Oostrum and T. Asano",
}

@Article{Shapiro:2001:CDT,
  author =       "Vadim Shapiro",
  title =        "A Convex Deficiency Tree Algorithm for Curved
                 Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "2",
  pages =        "215--238",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Vadim Shapiro and C. Bajaj",
}

@Article{ORourke:2001:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column $ 41 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "2",
  pages =        "239--242",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Joseph O'Rourke and D. T. Lee",
}

@Article{Hershberger:2001:GEF,
  author =       "John Hershberger",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "3",
  pages =        "243--244",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Burnikel:2001:EGC,
  author =       "Christoph Burnikel and Stefan Funke and Michael Seel",
  title =        "Exact Geometric Computation Using Cascading",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "3",
  pages =        "245--266",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Christoph Burnikel and Stefan Funke and Michael Seel
                 and others",
}

@Article{Andrade:2001:EAC,
  author =       "Marcus Vin{\'\i}cius Alvim Andrade and Jorge Stolfi",
  title =        "Exact Algorithms for Circles on the Sphere",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "3",
  pages =        "267--290",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Marcus Vin{\'\i}cius Alvim Andrade and Jorge Stolfi
                 and J. Hershberger",
}

@Article{Chan:2001:ESD,
  author =       "Timothy M. Chan",
  title =        "On Enumerating and Selecting Distances",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "3",
  pages =        "291--304",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Timothy M. Chan and J. Hershberger",
}

@Article{Crauser:2001:REM,
  author =       "A. Crauser and P. Ferragina and K. Mehlhorn and U.
                 Meyer and E. A. Ramos",
  title =        "Randomized External-Memory Algorithms for Line Segment
                 Intersection and Other Geometric Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "3",
  pages =        "305--337",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Arya:2001:AAM,
  author =       "Sunil Arya and Siu-Wing Cheng and David M. Mount",
  title =        "Approximation Algorithm for Multiple-Tool Milling",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "3",
  pages =        "339--372",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:45 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Sunil Arya and Siu-Wing Cheng and David M. Mount and
                 others",
}

@Article{Atallah:2001:CRB,
  author =       "Mikhail J. Atallah and Danny Z. Chen",
  title =        "On Connecting Red and Blue Rectilinear Polygonal
                 Obstacles with Nonintersecting Monotone Rectilinear
                 Paths",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "4",
  pages =        "373--400",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Mikhail J. Atallah and Danny Z. Chen and L. Guibas",
}

@Article{Lopez-Ortiz:2001:LBS,
  author =       "Alejandro L{\'o}pez-Ortiz and Sven Schuierer",
  title =        "Lower Bounds for Streets and Generalized Streets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "4",
  pages =        "401--421",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Alejandro L{\'o}pez-Ortiz and Sven Schuierer and K.
                 Mehlhorn",
}

@Article{Christof:2001:DPT,
  author =       "Thomas Christof and Gerhard Reinelt",
  title =        "Decomposition and Parallelization Techniques for
                 Enumerating the Facets of Combinatorial Polytopes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "4",
  pages =        "423--437",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Thomas Christof and Gerhard Reinelt and Michael
                 Goodrich",
}

@Article{Sendra:2001:ORP,
  author =       "J. Rafael Sendra and Carlos Villarino",
  title =        "Optimal Reparametrization of Polynomial Algebraic
                 Curves",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "4",
  pages =        "439--453",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "J. Rafael Sendra and Carlos Villarino and C. Bajaj",
}

@Article{Zhu:2001:EAA,
  author =       "Binhai Zhu and C. K. Poon",
  title =        "Efficient Approximation Algorithms for Two-Label Point
                 Labeling",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "4",
  pages =        "455--464",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Theory/map.labeling.bib;
                 http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  abstract =     "In this paper we propose and study two practical
                 variations of the map labeling problem: Given a set $S$
                 of $n$ distinct (point) sites in the plane, label each
                 site with: (1) a pair of non-intersecting squares of
                 maximum possible size, (2) a pair of non-intersecting
                 circles of maximum possible size (all the squares and
                 circles are topologically open and are of uniform
                 size). Almost nothing has been done before in this
                 aspect, i.e., multi-label map labeling. We obtain
                 constant-factor approximation algorithms for these
                 problems. We also study bicriteria approximation
                 schemes for these problems under a mild condition.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  keywords =     "approximation algorithms, map labeling, NP-hardness",
  xxauthor =     "Binhai Zhu and C. K. Poon and J. Mitchell",
}

@Article{Barequet:2001:PCT,
  author =       "Gill Barequet and Sariel Har-Peled",
  title =        "Polygon Containment and Translational
                 Min-{Hausdorff}-Distance Between Segment Sets are $3$
                 {SUM}-Hard",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "4",
  pages =        "465--474",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Gill Barequet and Sariel Har-Peled and J. Mitchell",
}

@Article{Wang:2001:CAM,
  author =       "Jiaye Wang and Ding Yuan Liu and Wenping Wang",
  title =        "Computing an Almost Minimum Set of Spanning Line
                 Segments of a Polyhedron",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "5",
  pages =        "475--485",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Jiaye Wang and Ding Yuan Liu and Wenping Wang and
                 others",
}

@Article{Chen:2001:CSC,
  author =       "Wei Chen and Xiaowen Deng and Koichi Wada and K.
                 Kawaguchi",
  title =        "Constructing a Strongly Convex Superhull of Points",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "5",
  pages =        "487--502",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Papadopoulou:2001:VDS,
  author =       "Evantha Papadopoulou and D. T. Lee",
  title =        "The {$ L_{\infty } $} {Voronoi} Diagram of Segments
                 and {VLSI} Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "5",
  pages =        "503--528",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Evantha Papadopoulou and D. T. Lee and F. P.
                 Preparata",
}

@Article{Suzuki:2001:SPR,
  author =       "Ichiro Suzuki and Yuichi Tazoe and Masafumi Yamashita
                 and T. Kameda",
  title =        "Searching a Polygonal Region from the Boundary",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "5",
  pages =        "529--553",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Devillers:2001:SB,
  author =       "Olivier Devillers and Philippe Guigue",
  title =        "The Shuffling Buffer",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "5",
  pages =        "555--572",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Olivier Devillers and Philippe Guigue and B.
                 Chazelle",
}

@Article{Mitchell:2001:CGC,
  author =       "Joseph S. B. Mitchell and Joseph O'Rourke",
  title =        "Computational Geometry Column $ 42 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "5",
  pages =        "573--582",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:46 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib; OCLC
                 Article1st database",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  xxauthor =     "Joseph S. B. Mitchell and Joseph O'Rourke and D. T.
                 Lee",
}

@Article{Mehlhorn:2001:FSA,
  author =       "Kurt Mehlhorn and Stefan Meiser and Ronald Rasch",
  title =        "Furthest Site Abstract {Voronoi} Diagrams",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "6",
  pages =        "583--??",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:47 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2001:GPQ,
  author =       "Danny Z. Chen and Ovidiu Daescu and Kevin S. Klenk",
  title =        "On Geometric Path Query Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "6",
  pages =        "617--??",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:47 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fekete:2001:TDL,
  author =       "S{\'a}ndor P. Fekete and Joseph S. B. Mitchell",
  title =        "Terrain Decomposition and Layered Manufacturing",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "6",
  pages =        "647--??",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:47 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Murphy:2001:PPS,
  author =       "Michael Murphy and David M. Mount and Carl W. Gable",
  title =        "A Point-Placement Strategy for Conforming {Delaunay}
                 Tetrahedralization",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "6",
  pages =        "669--??",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:47 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2001:AI,
  author =       "Anonymous",
  title =        "Author Index",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "11",
  number =       "6",
  pages =        "683--??",
  year =         "2001",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:47 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{deBerg:2002:GEF,
  author =       "Mark de Berg and Stefan Schirra",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "1--2",
  pages =        "1--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kirkpatrick:2002:KCD,
  author =       "David Kirkpatrick and Jack Snoeyink and Bettina
                 Speckmann",
  title =        "Kinetic Collision Detection for Simple Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "1--2",
  pages =        "3--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Doddi:2002:PSL,
  author =       "Srinivas R. Doddi and Madhav V. Marathe and Bernard M.
                 E. Moret",
  title =        "Point Set Labeling with Specified Positions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "1--2",
  pages =        "29--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Theory/map.labeling.bib;
                 http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "http://www.cs.unm.edu/~moret/papers.html",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chan:2002:ADW,
  author =       "Timothy M. Chan",
  title =        "Approximating the Diameter, Width, Smallest Enclosing
                 Cylinder, and Minimum-Width Annulus",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "1--2",
  pages =        "67--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lavalle:2002:ASP,
  author =       "Steven M. Lavalle and Borislav H. Simov and Giora
                 Slutzki",
  title =        "An Algorithm for Searching a Polygonal Region with a
                 Flashlight",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "1--2",
  pages =        "87--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Brass:2002:TCD,
  author =       "Peter Brass and Christian Knauer",
  title =        "Testing the Congruence of $d$-Dimensional Point Sets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "1--2",
  pages =        "115--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Amenta:2002:SAH,
  author =       "Nina Amenta and Sunghee Choi and Tamal K. Dey and
                 Naveen Leekha",
  title =        "A Simple Algorithm for Homeomorphic Surface
                 Reconstruction",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "1--2",
  pages =        "125--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Zomorodian:2002:FSB,
  author =       "Afra Zomorodian and Herbert Edelsbrunner",
  title =        "Fast Software for Box Intersections",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "1--2",
  pages =        "143--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Binger:2002:PUI,
  author =       "David Binger",
  title =        "Polyhedra with Unguarded Interiors",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "3",
  pages =        "173--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Keil:2002:TBC,
  author =       "Mark Keil and Jack Snoeyink",
  title =        "On the Time Bound for Convex Decomposition of Simple
                 Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "3",
  pages =        "181--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Devillers:2002:DDT,
  author =       "Olivier Devillers",
  title =        "On Deletion in {Delaunay} Triangulations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "3",
  pages =        "193--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ha:2002:EAR,
  author =       "Jong-Sung Ha and Sung-Yong Shin",
  title =        "Edge Advancing Rules for Intersecting Spherical Convex
                 Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "3",
  pages =        "207--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bespamyatnikh:2002:OMB,
  author =       "Sergei Bespamyatnikh",
  title =        "An Optimal Morphing Between Polylines",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "3",
  pages =        "217--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Devillers:2002:CRE,
  author =       "Olivier Devillers and Pedro A. Ramos",
  title =        "Computing Roundness is Easy if the Set is Almost
                 Round",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "3",
  pages =        "229--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tan:2002:FOB,
  author =       "Xuehou Tan",
  title =        "Finding an Optimal Bridge Between Two Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "3",
  pages =        "249--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:2002:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column $ 43 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "3",
  pages =        "263--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:48 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tokuyama:2002:GEF,
  author =       "Takeshi Tokuyama",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "4",
  pages =        "267--??",
  month =        aug,
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:49 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wolff:2002:SFA,
  author =       "Alexander Wolff and Michael Thon and Yinfeng Xu",
  title =        "A Simple Factor-$ \frac {2}{3} $ Approximation
                 Algorithm for Two-Circle Point Labeling",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "4",
  pages =        "269--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibsource =    "ftp://ftp.ira.uka.de/bibliography/Theory/map.labeling.bib;
                 http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "http://www.math-inf.uni-greifswald.de/map-labeling/papers/wtx-sf23a-01.pdf;
                 http://www.math-inf.uni-greifswald.de/map-labeling/papers/wtx-sf23a-01.ps",
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2002:ORC,
  author =       "Prosenjit Bose and Andrej Brodnik and Svante Carlsson
                 and Erik D. Demaine and Rudolf Fleischer and Alejandro
                 L{\'o}pez-Ortiz and Pat Morin and J. Ian Munro",
  title =        "Online Routing in Convex Subdivisions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "4",
  pages =        "283--??",
  month =        aug,
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:49 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2002:IAS,
  author =       "Prosenjit Bose and Pat Morin",
  title =        "An Improved Algorithm for Subdivision Traversal
                 without Extra Storage",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "4",
  pages =        "297--??",
  month =        aug,
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:49 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2002:OPC,
  author =       "Danny Z. Chen and Xiaobo S. Hu and Xiaodong Wu",
  title =        "Optimal Polygon Cover Problems and Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "4",
  pages =        "309--??",
  month =        aug,
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:49 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Park:2002:SRT,
  author =       "Sang-Min Park and Jae-Ha Lee and Kyung-Yong Chwa",
  title =        "Searching a Room by Two Guards",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "4",
  pages =        "339--??",
  month =        aug,
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:49 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dey:2002:FRC,
  author =       "Tamal K. Dey and Rephael Wenger",
  title =        "Fast Reconstruction of Curves with Sharp Corners",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "5",
  pages =        "353--??",
  month =        oct,
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:49 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dumitrescu:2002:PCP,
  author =       "Adrian Dumitrescu and J{\'a}nos Pach",
  title =        "Partitioning Colored Point Sets into Monochromatic
                 Parts",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "5",
  pages =        "401--??",
  month =        oct,
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:49 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2002:ISA,
  author =       "Danny Z. Chen and Jie Wang and Xiaodong Wu",
  title =        "Image Segmentation with Asteroidality\slash Tubularity
                 and Smoothness Constraints",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "5",
  pages =        "413--??",
  month =        oct,
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:49 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Katoh:2002:PPO,
  author =       "Naoki Katoh and Hisao Tamaki and Takeshi Tokuyama",
  title =        "Parametric Polymatroid Optimization and Its Geometric
                 Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "5",
  pages =        "429--??",
  month =        oct,
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:49 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2002:DMW,
  author =       "Prosenjit Bose and Luc Devroye and William Evans",
  title =        "Diamonds are Not a Minimum Weight Triangulation's Best
                 Friend",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "6",
  pages =        "445--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:50 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Imai:2002:ETG,
  author =       "Hiroshi Imai and Tomonari Masada and Fumihiko Takeuchi
                 and Keiko Imai",
  title =        "Enumerating Triangulations in General Dimensions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "6",
  pages =        "455--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:50 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Weng:2002:GMC,
  author =       "Jia F. Weng",
  title =        "Generalized {Melzak}'s Construction in the {Steiner}
                 Tree Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "6",
  pages =        "481--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:50 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Malandain:2002:CDP,
  author =       "Gr{\'e}goire Malandain and Jean-Daniel Boissonnat",
  title =        "Computing the Diameter of a Point Set",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "6",
  pages =        "489--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:50 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Koike:2002:LPR,
  author =       "Atsushi Koike and Shin-Ichi Nakano and Takao Nishizeki
                 and Takeshi Tokuyama and Shuhei Watanabe",
  title =        "Labeling Points with Rectangles of Various Shapes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "6",
  pages =        "511--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:50 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2002:AI,
  author =       "Anonymous",
  title =        "Author Index",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "12",
  number =       "6",
  pages =        "529--??",
  year =         "2002",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:50 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lee:2003:CEN,
  author =       "D. T. Lee",
  title =        "{Chief Editor}'s Notice",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "1",
  pages =        "1--??",
  month =        feb,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:51 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tamassia:2003:GEF,
  author =       "Roberto Tamassia",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "1",
  pages =        "3--??",
  month =        feb,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:51 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Basch:2003:PAD,
  author =       "Julien Basch and Harish Devarajan and Piotr Indyk and
                 Li Zhang",
  title =        "Probabilistic Analysis for Discrete Attributes of
                 Moving Points",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "1",
  pages =        "5--??",
  month =        feb,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:51 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kakoulis:2003:UAA,
  author =       "Konstantinos G. Kakoulis and Ioannis G. Tollis",
  title =        "A Unified Approach to Automatic Label Placement",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "1",
  pages =        "23--??",
  month =        feb,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:51 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cohen:2003:SMA,
  author =       "Jonathan Cohen and Dinesh Manocha and Marc Olano",
  title =        "Successive Mappings: An Approach to Polygonal Mesh
                 Simplification with Guaranteed Error Bounds",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "1",
  pages =        "61--??",
  month =        feb,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:51 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2003:SEA,
  author =       "Danny Z. Chen and Ovidiu Daescu",
  title =        "Space-Efficient Algorithms for Approximating Polygonal
                 Curves in Two-Dimensional Space",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "2",
  pages =        "95--??",
  month =        apr,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:51 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Galtier:2003:SEF,
  author =       "Jer{\^o}me Galtier and Ferran Hurtado and Marc Noy and
                 St{\'e}phane P{\'e}rennes and Jorge Urrutia",
  title =        "Simultaneous Edge Flipping in Triangulations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "2",
  pages =        "113--??",
  month =        apr,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:51 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2003:TPA,
  author =       "Danny Z. Chen and Shuang Luan and Jinhui Xu",
  title =        "Topological Peeling and Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "2",
  pages =        "135--??",
  month =        apr,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:51 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fink:2003:PSV,
  author =       "Eugene Fink and Derick Wood",
  title =        "Planar Strong Visibility",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "2",
  pages =        "173--??",
  month =        apr,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:51 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Boissonnat:2003:PTA,
  author =       "Jean-Daniel Boissonnat and Sylvain Lazard",
  title =        "A Polynomial-Time Algorithm for Computing Shortest
                 Paths of Bounded Curvature Amidst Moderate Obstacles",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "3",
  pages =        "189--??",
  month =        jun,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Devillers:2003:CSP,
  author =       "Olivier Devillers and Franco P. Preparata",
  title =        "Culling a Set of Points for Roundness or Cylindricity
                 Evaluations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "3",
  pages =        "231--??",
  month =        jun,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mehlhorn:2003:IFT,
  author =       "Kurt Mehlhorn and Michael Seel",
  title =        "Infimaximal Frames: a Technique for Making Lines Look
                 Like Segments",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "3",
  pages =        "241--??",
  month =        jun,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mukhopadhyay:2003:CLE,
  author =       "Asish Mukhopadhyay and S. V. Rao",
  title =        "On Computing a Largest Empty Arbitrarily Oriented
                 Rectangle",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "3",
  pages =        "257--??",
  month =        jun,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:2003:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column $ 44 $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "3",
  pages =        "273--??",
  month =        jun,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Sugihara:2003:GEF,
  author =       "Kokichi Sugihara",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "4",
  pages =        "277--??",
  month =        aug,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gavrilova:2003:CDO,
  author =       "Marina L. Gavrilova and Jon Rokne",
  title =        "Collision Detection Optimization in a Multi-Particle
                 System",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "4",
  pages =        "279--??",
  month =        aug,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Andersson:2003:BPM,
  author =       "Mattias Andersson and Joachim Gudmundsson and Christos
                 Levcopoulos and Giri Narasimhan",
  title =        "Balanced Partition of Minimum Spanning Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "4",
  pages =        "303--??",
  month =        aug,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Diaz-Banez:2003:LEA,
  author =       "J. M. D{\'i}az-B{\'a}{\~n}ez and F. Hurtado and H.
                 Meijer and D. Rappaport and J. A. Sellar{\`e}s",
  title =        "The Largest Empty Annulus Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "4",
  pages =        "317--??",
  month =        aug,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Giesen:2003:SFD,
  author =       "Joachim Giesen and Matthias John and Michel
                 St{\"o}cklin",
  title =        "Symmetry of Flow Diagrams Derived from Weighted Points
                 in the Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "4",
  pages =        "327--??",
  month =        aug,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dakowicz:2003:EMS,
  author =       "Maciej Dakowicz and Christopher Gold",
  title =        "Extracting Meaningful Slopes from Terrain Contours",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "4",
  pages =        "339--??",
  month =        aug,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 08:18:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bajaj:2003:MSC,
  author =       "Chandrajit L. Bajaj and Guoliang Xu and Robert J. Holt
                 and Arun N. Netravali",
  title =        "{NURBS} Approximation of {$A$}-splines and
                 {$A$}-patches",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "5",
  pages =        "359--??",
  month =        oct,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 09:28:05 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Devillers:2003:MSC,
  author =       "Olivier Devillers and Regina Estkowski and
                 Pierre-Marie Gandoin and Ferran Hurtado and Pedro Ramos
                 and Vera Sacrist{\'a}n",
  title =        "Minimal set of constraints for $2$ d constrained
                 {Delaunay} reconstruction",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "5",
  pages =        "391--??",
  month =        oct,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 06 10:38:30 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Culver:2003:HAD,
  author =       "Tim Culver and John Keyser and Dinesh Manocha and
                 Shankar Krishnan",
  title =        "A Hybrid Approach for Determinant Signs of
                 Moderate-Sized Matrices",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "5",
  pages =        "399--??",
  month =        oct,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 09:28:05 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bespamyatnikh:2003:CCP,
  author =       "Sergei Bespamyatnikh",
  title =        "Computing Closest Points for Segments",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "5",
  pages =        "419--??",
  month =        oct,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 09:28:05 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Brass:2003:CCA,
  author =       "Peter Bra{\ss} and Laura Heinrich-Litan and Pat
                 Morin",
  title =        "Computing the Center of Area of a Convex Polygon",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "5",
  pages =        "439--??",
  month =        oct,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 15 09:28:05 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2003:PAG,
  author =       "Prosenjit Bose and Hazel Everett and Stephen Wismath",
  title =        "Properties of Arrangement Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "6",
  pages =        "447--??",
  month =        dec,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Linhart:2003:ESL,
  author =       "Chaim Linhart and Dan Halperin and Iddo Hanniel and
                 Sariel Har-Peled",
  title =        "An Experimental Study of On-Line Methods for Zone
                 Construction in Arrangements of Lines in the Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "6",
  pages =        "463--??",
  month =        dec,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Garg:2003:AEO,
  author =       "Ashim Garg and Adrian Rusu",
  title =        "Area-Efficient Order-Preserving Planar Straight-Line
                 Drawings of Ordered Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "6",
  pages =        "487--??",
  month =        dec,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2003:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 13 (2003)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "13",
  number =       "6",
  pages =        "507--??",
  month =        dec,
  year =         "2003",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Zhu:2004:GEF,
  author =       "Binhai Zhu",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "1--2",
  pages =        "1--??",
  month =        apr,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bereg:2004:CHD,
  author =       "Sergey Bereg",
  title =        "Cylindrical Hierarchy for Deforming Necklaces",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "1--2",
  pages =        "3--??",
  month =        apr,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Xu:2004:TSP,
  author =       "Jinhui Xu and Zhiyong Lin and Yang Yang and Ronald
                 Berezney",
  title =        "Traveling Salesman Problem of Segments",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "1--2",
  pages =        "19--??",
  month =        apr,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Breukelaar:2004:THE,
  author =       "Ron Breukelaar and Erik D. Demaine and Susan
                 Hohenberger and Hendrik Jan Hoogeboom and Walter A.
                 Kosters and David Liben-Nowell",
  title =        "{Tetris} Is Hard, Even To Approximate",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "1--2",
  pages =        "41--??",
  month =        apr,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Li:2004:ECL,
  author =       "Xiang-Yang Li and Yu Wang",
  title =        "Efficient Construction of Low Weighted Bounded Degree
                 Planar Spanner",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "1--2",
  pages =        "69--??",
  month =        apr,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wu:2004:EAA,
  author =       "Xiaodong Wu and Danny Z. Chen and James J. Mason and
                 Steven R. Schmid",
  title =        "Efficient Approximation Algorithms for Pairwise Data
                 Clustering and Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "1--2",
  pages =        "85--??",
  month =        apr,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Collins:2004:CSP,
  author =       "Michael J. Collins",
  title =        "Covering a Set of Points with a Minimum Number of
                 Turns",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "1--2",
  pages =        "105--??",
  month =        apr,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lienhardt:2004:CPS,
  author =       "Pascal Lienhardt and Xavier Skapin and Antoine
                 Bergey",
  title =        "{Cartesian} Product of Simplicial and Cellular
                 Structures",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "3",
  pages =        "115--??",
  month =        jun,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Goldman:2004:UIE,
  author =       "Ron Goldman and Wenping Wang",
  title =        "Using Invariants To Extract Geometric Characteristics
                 of Conic Sections From Rational Quadratic
                 Parameterizations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "3",
  pages =        "161--??",
  month =        jun,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Zhu:2004:APC,
  author =       "Binhai Zhu",
  title =        "Approximating {$3$D} Points with Cylindrical
                 Segments",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "3",
  pages =        "189--??",
  month =        jun,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Suderman:2004:PLD,
  author =       "Matthew Suderman",
  title =        "Pathwidth and Layered Drawings of Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "3",
  pages =        "203--??",
  month =        jun,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:2004:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column 45",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "3",
  pages =        "227--??",
  month =        jun,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mitchell:2004:EF,
  author =       "Joseph S. B. Mitchell",
  title =        "{Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "4--5",
  pages =        "231--??",
  month =        oct,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{VanKreveld:2004:GNP,
  author =       "Marc {Van Kreveld} and Iris Reinbacher",
  title =        "Good News: Partitioning a Simple Polygon by Compass
                 Directions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "4--5",
  pages =        "233--??",
  month =        oct,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mitra:2004:ESN,
  author =       "Niloy J. Mitra and An Nguyen and Leonidas Guibas",
  title =        "Estimating Surface Normals in Noisy Point Cloud Data",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "4--5",
  pages =        "261--??",
  month =        oct,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Halperin:2004:CPA,
  author =       "Dan Halperin and Eran Leiserowitz",
  title =        "Controlled Perturbation for Arrangements of Circles",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "4--5",
  pages =        "277--??",
  month =        oct,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2004:GAS,
  author =       "Danny Z. Chen and Xiaobo S. Hu and Shuang (Sean) Luan
                 and Chao Wang and Xiaodong Wu",
  title =        "Geometric Algorithms for Static Leaf Sequencing
                 Problems in Radiation Therapy",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "4--5",
  pages =        "311--??",
  month =        oct,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fischer:2004:SEB,
  author =       "Kaspar Fischer and Bernd G{\"a}rtner",
  title =        "The Smallest Enclosing Ball of Balls: Combinatorial
                 Structure and Algorithms",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "4--5",
  pages =        "341--??",
  month =        oct,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jan 6 10:25:21 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Jiao:2004:OSMa,
  author =       "Xiangmin Jiao and Michael T. Heath",
  title =        "Overlaying Surface Meshes, {Part I}: Algorithms",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "6",
  pages =        "379--??",
  month =        dec,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 24 15:09:37 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Jiao:2004:OSMb,
  author =       "Xiangmin Jiao and Michael T. Heath",
  title =        "Overlaying Surface Meshes, {Part II}: Topology
                 Preservation and Feature Matching",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "6",
  pages =        "403--??",
  month =        dec,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 24 15:09:37 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Papadopoulou:2004:HVD,
  author =       "Evanthia Papadopoulou and D. T. Lee",
  title =        "The {Hausdorff Voronoi} Diagram of Polygonal Objects:
                 a Divide and Conquer Approach",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "6",
  pages =        "421--??",
  month =        dec,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 24 15:09:37 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ahn:2004:RFH,
  author =       "Hee-Kap Ahn and Siu-Wing Cheng and Otfried Cheong and
                 Jack Snoeyink",
  title =        "The Reflex-Free Hull",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "6",
  pages =        "453--??",
  month =        dec,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 24 15:09:37 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:2004:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column 46",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "6",
  pages =        "475--??",
  month =        dec,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 24 15:09:37 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2004:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 14 (2004)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "14",
  number =       "6",
  pages =        "479--??",
  month =        dec,
  year =         "2004",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 24 15:09:37 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chew:2005:GEF,
  author =       "Paul Chew and Alper {\"U}ng{\"o}r",
  title =        "{Guest Editors'} Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "1",
  pages =        "1--??",
  month =        feb,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 24 15:09:37 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Blandford:2005:CRS,
  author =       "Daniel K. Blandford and Guy E. Blelloch and David E.
                 Cardoze and Clemens Kadow",
  title =        "Compact Representations of Simplicial Meshes in Two
                 and Three Dimensions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "1",
  pages =        "3--??",
  month =        feb,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 24 15:09:37 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Miller:2005:WWD,
  author =       "Gary L. Miller and Steven E. Pav and Noel J.
                 Walkington",
  title =        "When and Why {Delaunay} Refinement Algorithms Work",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "1",
  pages =        "25--??",
  month =        feb,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 24 15:09:37 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ramaswami:2005:CQM,
  author =       "Suneeta Ramaswami and Marcelo Siqueira and Tessa
                 Sundaram and Jean Gallier and James Gee",
  title =        "Constrained Quadrilateral Meshes of Bounded Size",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "1",
  pages =        "55--??",
  month =        feb,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 24 15:09:37 MST 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gavrilova:2005:GEF,
  author =       "Marina L. Gavrilova",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "2",
  pages =        "99--??",
  month =        apr,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri May 6 06:02:18 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Toussaint:2005:GPG,
  author =       "Godfried Toussaint",
  title =        "Geometric Proximity Graphs for Improving Nearest
                 Neighbor Methods in Instance-Based Learning and Data
                 Mining",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "2",
  pages =        "101--??",
  month =        apr,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri May 6 06:02:18 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kanda:2005:TDR,
  author =       "Takeshi Kanda and Kokichi Sugihara",
  title =        "Two-Dimensional Range Search Based on the {Voronoi}
                 Diagram",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "2",
  pages =        "151--??",
  month =        apr,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri May 6 06:02:18 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hurtado:2005:RBS,
  author =       "Ferran Hurtado and Carlos Seara and Saurabh Sethia",
  title =        "Red-Blue Separability Problems in {$3$D}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "2",
  pages =        "167--??",
  month =        apr,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri May 6 06:02:18 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bereg:2005:AMB,
  author =       "Sergey Bereg",
  title =        "An Approximate Morphing Between Polylines",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "2",
  pages =        "193--??",
  month =        apr,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri May 6 06:02:18 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kim:2005:EVD,
  author =       "Donguk Kim and Deok-Soo Kim and Kokichi Sugihara",
  title =        "{Euclidean} {Voronoi} Diagram for Circles in a
                 Circle",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "2",
  pages =        "209--??",
  month =        apr,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri May 6 06:02:18 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kaneko:2005:SBP,
  author =       "Atsushi Kaneko and Mikio Kano",
  title =        "Semi-Balanced Partitions of Two Sets of Points and
                 Embeddings of Rooted Forests",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "3",
  pages =        "229--??",
  month =        jun,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jul 7 07:36:08 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2005:GAD,
  author =       "Danny Z. Chen and Michiel Smid and Bin Xu",
  title =        "Geometric Algorithms for Density-Based Data
                 Clustering",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "3",
  pages =        "239--??",
  month =        jun,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jul 7 07:36:08 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2005:LPS,
  author =       "Yu-Shin Chen and D. T. Lee and Chung-Shou Liao",
  title =        "Labeling Points on a Single Line",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "3",
  pages =        "261--??",
  month =        jun,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jul 7 07:36:08 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{VanDerMeiden:2005:EMD,
  author =       "Hilderick A. {Van Der Meiden} and Willem F.
                 Bronsvoort",
  title =        "An Efficient Method to Determine the Intended Solution
                 for a System of Geometric Constraints",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "3",
  pages =        "279--??",
  month =        jun,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jul 7 07:36:08 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wang:2005:ENU,
  author =       "Huawei Wang and Kaihuai Qin and Hanqiu Sun",
  title =        "Evaluation of Non-Uniform {Doo--Sabin} Surfaces",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "3",
  pages =        "299--??",
  month =        jun,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Jul 7 07:36:08 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Barequet:2005:GEF,
  author =       "Gill Barequet",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "4",
  pages =        "325--??",
  month =        aug,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:34 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Baran:2005:OAA,
  author =       "Ilya Baran and Erik D. Demaine",
  title =        "Optimal Adaptive Algorithms for Finding the Nearest
                 and Farthest Point on a Parametric Black-Box Curve",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "4",
  pages =        "327--??",
  month =        aug,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:34 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wein:2005:CPV,
  author =       "Ron Wein and Oleg Ilushin and Gershon Elber and Dan
                 Halperin",
  title =        "Continuous Path Verification in Multi-Axis
                 {NC}-Machining",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "4",
  pages =        "351--??",
  month =        aug,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:34 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Funke:2005:FPR,
  author =       "Stefan Funke and Theocharis Malamatos and Rahul Ray",
  title =        "Finding planar regions in a terrain -- in practice and
                 with a guarantee",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "4",
  pages =        "379--??",
  month =        aug,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:34 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Demaine:2005:SPS,
  author =       "Erik D. Demaine and Jeff Erickson and Ferran Hurtado
                 and John Iacono and Stefan Langerman and Henk Meijer
                 and Mark Overmars and Sue Whitesides",
  title =        "Separating Point Sets in Polygonal Environments",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "4",
  pages =        "403--??",
  month =        aug,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:34 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cheng:2005:QMP,
  author =       "Siu-Wing Cheng and Tamal K. Dey and Edgar A. Ramos and
                 Tathagata Ray",
  title =        "Quality Meshing of Polyhedra with Small Angles",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "4",
  pages =        "421--??",
  month =        aug,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:34 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dehne:2005:MVR,
  author =       "Frank Dehne and Rolf Klein and Raimund Seidel",
  title =        "Maximizing a {Voronoi} Region: the Convex Case",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "5",
  pages =        "463--??",
  month =        oct,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:35 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Rababah:2005:DRT,
  author =       "Abedallah Rababah",
  title =        "{$ L_2 $} Degree Reduction of Triangular {B{\'e}zier}
                 Surfaces with Common Tangent Planes At Vertices",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "5",
  pages =        "477--??",
  month =        oct,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:35 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Guha:2005:JSG,
  author =       "Sumanta Guha",
  title =        "Joint Separation of Geometric Clusters and the Extreme
                 Irregularities of Regular Polyhedra",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "5",
  pages =        "491--??",
  month =        oct,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:35 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cazals:2005:DTG,
  author =       "Fr{\'e}d{\'e}ic Cazals and Marc Pouget",
  title =        "Differential Topology and Geometry of Smooth Embedded
                 Surfaces: Selected Topics",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "5",
  pages =        "511--??",
  month =        oct,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:35 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Brass:2005:LBL,
  author =       "Peter Brass and Mehrbod Sharifi",
  title =        "A Lower Bound for {Lebesgue}'s Universal Cover
                 Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "5",
  pages =        "537--??",
  month =        oct,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 21 09:24:35 MDT 2005",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Meijer:2005:GEF,
  author =       "Henk Meijer and David Rappaport",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "6",
  pages =        "545--??",
  month =        dec,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Archambault:2005:CSA,
  author =       "Daniel Archambault and Willam Evans and David
                 Kirkpatrick",
  title =        "Computing the Set of All the Distant Horizons of a
                 Terrain",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "6",
  pages =        "547--??",
  month =        dec,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Falconer:2005:MLR,
  author =       "Sean M. Falconer and Bradford G. Nickerson",
  title =        "On Multi-Level $k$-Ranges for Range Search",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "6",
  pages =        "565--??",
  month =        dec,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Calinescu:2005:SPA,
  author =       "Gruia C{\u{a}}linescu and Adrian Dumitrescu and Howard
                 Karloff and Peng-Jun Wan",
  title =        "Separating Points by Axis-Parallel Lines",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "6",
  pages =        "575--??",
  month =        dec,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2005:GMR,
  author =       "Prosenjit Bose and Marc {Van Kreveld}",
  title =        "Generalizing Monotonicity: on Recognizing Special
                 Classes of Polygons and Polyhedra",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "6",
  pages =        "591--??",
  month =        dec,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bhosle:2005:EAA,
  author =       "Amit M. Bhosle and Teofilo F. Gonzalez",
  title =        "Exact and Approximation Algorithms for Finding an
                 Optimal Bridge Connecting Two Simple Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "6",
  pages =        "609--??",
  month =        dec,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2005:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 15 (2005)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "15",
  number =       "6",
  pages =        "631--??",
  month =        dec,
  year =         "2005",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Arkin:2006:SLB,
  author =       "Esther M. Arkin and Ferran Hurtado and Joseph S. B.
                 Mitchell and Carlos Seara and Steven S. Skiena",
  title =        "Some Lower Bounds on Geometric Separability Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "1",
  pages =        "1--??",
  month =        feb,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Michelucci:2006:IBT,
  author =       "Dominique Michelucci and Sebti Foufou",
  title =        "Interval-Based Tracing of Strange Attractors",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "1",
  pages =        "27--??",
  month =        feb,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tang:2006:MAC,
  author =       "Kai Tang and Charlie C. L. Wang and Danny Z. Chen",
  title =        "Minimum Area Convex Packing of Two Convex Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "1",
  pages =        "41--??",
  month =        feb,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Xu:2006:DLB,
  author =       "Guoliang Xu",
  title =        "Discrete {Laplace--Beltrami} Operator on Sphere and
                 Optimal Spherical Triangulations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "1",
  pages =        "75--??",
  month =        feb,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fleischer:2006:GEF,
  author =       "Rudolf Fleischer",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "2--3",
  pages =        "95--??",
  month =        jun,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aronov:2006:PFP,
  author =       "Boris Aronov and Tetsuo Asano and Naoki Katoh and Kurt
                 Mehlhorn and Takeshi Tokuyama",
  title =        "Polyline Fitting of Planar Points Under Min-Sum
                 Criteria",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "2--3",
  pages =        "97--??",
  month =        jun,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bae:2006:VDT,
  author =       "Sang Won Bae and Kyung-Yong Chwa",
  title =        "{Voronoi} Diagrams for a Transportation Network on the
                 {Euclidean} Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "2--3",
  pages =        "117--??",
  month =        jun,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chan:2006:GOP,
  author =       "Timothy M. Chan and Bashir S. Sadjad",
  title =        "Geometric Optimization Problems Over Sliding Windows",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "2--3",
  pages =        "145--??",
  month =        jun,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2006:SVC,
  author =       "Chao Chen and Ho-Lun Cheng",
  title =        "Superimposing {Voronoi} Complexes for Shape
                 Deformation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "2--3",
  pages =        "159--??",
  month =        jun,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2006:GGA,
  author =       "Danny Z. Chen and Xiaobo X. Hu and Shuang Luan and
                 Shahid A. Naqvi and Chao Wang and Cedric X. Yu",
  title =        "Generalized Geometric Approaches for Leaf Sequencing
                 Problems in Radiation Therapy",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "2--3",
  pages =        "175--??",
  month =        jun,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chwa:2006:GAG,
  author =       "Kyung-Yong Chwa and Byung-Cheol Jo and Christian
                 Knauer and Esther Moet and Ren{\'e} Van Oostrum and
                 Chan-Su Shin",
  title =        "Guarding Art Galleries by Guarding Witnesses",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "2--3",
  pages =        "205--??",
  month =        jun,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Daescu:2006:CPL,
  author =       "Ovidiu Daescu and Jun Luo",
  title =        "Cutting Out Polygons with Lines and Rays",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "2--3",
  pages =        "227--??",
  month =        jun,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Miura:2006:IRD,
  author =       "Kazuyuki Miura and Hiroki Haga and Takao Nishizeki",
  title =        "Inner Rectangular Drawings of Plane Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "2--3",
  pages =        "249--??",
  month =        jun,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Nowakowski:2006:BOT,
  author =       "Richard J. Nowakowski and Norbert Zeh",
  title =        "Boundary-Optimal Triangulation Flooding",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "2--3",
  pages =        "271--??",
  month =        jun,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:00 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Carlsson:2006:ATM,
  author =       "Erik Carlsson and Gunnar Carlsson and Vin {De Silva}",
  title =        "An Algebraic Topological Method for Feature
                 Identification",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "4",
  pages =        "291--??",
  month =        aug,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Diaz-Banez:2006:AVD,
  author =       "J. M. D{\'i}az-B{\'a}{\~n}ez and F. G{\'o}mez and I.
                 Ventura",
  title =        "The Anchored {Voronoi} Diagram: Static, Dynamic
                 Versions and Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "4",
  pages =        "315--??",
  month =        aug,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dror:2006:TSM,
  author =       "Moshe Dror and Yusin Lee and James B. Orlin and
                 Valentin Polishchuk",
  title =        "The {TSP} and the Sum of Its Marginal Values",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "4",
  pages =        "333--??",
  month =        aug,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Durocher:2006:SCS,
  author =       "Stephane Durocher and David Kirkpatrick",
  title =        "The {Steiner} Centre of a Set of Points: Stability,
                 Eccentricity, and Applications to Mobile Facility
                 Location",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "4",
  pages =        "345--??",
  month =        aug,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:2006:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column 47",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "4",
  pages =        "373--??",
  month =        aug,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gao:2006:GEF,
  author =       "Xiao-Shan Gao and Dominique Michelucci",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "377--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Jermann:2006:DGC,
  author =       "Christophe Jermann and Gilles Trombettoni and Bertrand
                 Neveu and Pascal Mathis",
  title =        "Decomposition of Geometric Constraint Systems: a
                 Survey",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "379--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Jackson:2006:RFD,
  author =       "Bill Jackson and Tibor Jord{\'a}n",
  title =        "On the Rank Function of the $3$-Dimensional Rigidity
                 Matroid",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "415--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Schreck:2006:GCS,
  author =       "Pascal Schreck and Pascal Mathis",
  title =        "Geometrical Constraint System Decomposition: a
                 Multi-Group Approach",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "431--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Michelucci:2006:ICC,
  author =       "Dominique Michelucci and Pascal Schreck",
  title =        "Incidence Constraints: a Combinatorial Approach",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "443--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Zhang:2006:WCC,
  author =       "Gui-Fang Zhang and Xiao-Shan Gao",
  title =        "Well-Constrained Completion and Decomposition for
                 Under-Constrained Geometric Constraint Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "461--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Trombettoni:2006:GFA,
  author =       "Gilles Trombettoni and Marta Wilczkowiak",
  title =        "{GPDOF} --- a Fast Algorithm to Decompose
                 Under-Constrained Geometric Constraint Systems:
                 Application to {$3$D} Modeling",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "479--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Zhang:2006:BSI,
  author =       "Ming Zhang and Liqun Wang and Ronald Goldman",
  title =        "{B{\'e}zier} Subdivision for Inverse Molecular
                 Kinematics",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "513--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Yang:2006:SSC,
  author =       "Lu Yang",
  title =        "Solving Spatial Constraints with Global Distance
                 Coordinate System",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "533--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{SerrE:2006:NCM,
  author =       "Philippe Serr{\'e} and Auxkin Ortuzar and Alain
                 Rivi{\`e}re",
  title =        "Non-{Cartesian} Modelling for Analysis of the
                 Consistency of a Geometric Specification for Conceptual
                 Design",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "549--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chang:2006:SPA,
  author =       "Ee-Chien Chang and Sung Woo Choi and Do Yong Kwon and
                 Hyungju Park and Chee K. Yap",
  title =        "Shortest Path Amidst Disc Obstacles Is Computable",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "567--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Sitharam:2006:WFS,
  author =       "Meera Sitharam",
  title =        "Well-Formed Systems of Point Incidences for Resolving
                 Collections of Rigid Bodies",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "591--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2006:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 16 (2006)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "16",
  number =       "5--6",
  pages =        "617--??",
  month =        dec,
  year =         "2006",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Nov 15 09:28:01 MST 2006",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Spielman:2007:PDR,
  author =       "Daniel A. Spielman and Shang-Hua Teng and Alper
                 {\"U}ng{\"o}r",
  title =        "Parallel {Delaunay} Refinement: Algorithms and
                 Analyses",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "1",
  pages =        "1--30",
  month =        feb,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002227",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:05 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Boutin:2007:WPC,
  author =       "Mireille Boutin and Gregor Kemper",
  title =        "Which Point Configurations Are Determined by the
                 Distribution of Their Pairwise Distances?",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "1",
  pages =        "31--43",
  month =        feb,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002239",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:05 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cheong:2007:IHP,
  author =       "Jae-Sook Cheong and A. Frank {Van Der Stappen} and Ken
                 Goldberg and Mark H. Overmars and Elon Rimon",
  title =        "Immobilizing Hinged Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "1",
  pages =        "45--69",
  month =        feb,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002240",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:05 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Memarsadeghi:2007:FII,
  author =       "Nargess Memarsadeghi and David M. Mount and Nathan S.
                 Netanyahu and Jacqueline Le Moigne",
  title =        "A Fast Implementation of the {ISODATA} Clustering
                 Algorithm",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "1",
  pages =        "71--103",
  month =        feb,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002252",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:05 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Worman:2007:PDO,
  author =       "Chris Worman and J. Mark Keil",
  title =        "Polygon Decomposition and the Orthogonal Art Gallery
                 Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "2",
  pages =        "105--138",
  month =        apr,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002264",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:05 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{DiGiacomo:2007:SEO,
  author =       "Emilio {Di Giacomo} and Giuseppe Liotta",
  title =        "Simultaneous Embedding of Outerplanar Graphs, Paths,
                 and Cycles",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "2",
  pages =        "139--160",
  month =        apr,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002276",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:05 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kirchner:2007:FCS,
  author =       "Stefan Kirchner",
  title =        "An {FPTAS} for Computing the Similarity of
                 Three-Dimensional Point Sets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "2",
  pages =        "161--174",
  month =        apr,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002288",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:05 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Milenkovic:2007:AAA,
  author =       "Victor Milenkovic and Elisha Sacks",
  title =        "An Approximate Arrangement Algorithm for
                 Semi-Algebraic Curves",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "2",
  pages =        "175--198",
  month =        apr,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819590700229X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:05 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Zhang:2007:GEF,
  author =       "Li Zhang",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "3",
  pages =        "199--200",
  month =        jun,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002306",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ebbers-Baumann:2007:EPS,
  author =       "Annette Ebbers-Baumann and Ansgar Gr{\"u}ne and Rolf
                 Klein and Marek Karpinski and Christian Knauer and
                 Andrzej Lingas",
  title =        "Embedding Point Sets into Plane Graphs of Small
                 Dilation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "3",
  pages =        "201--230",
  month =        jun,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002318",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Muller-Hannemann:2007:HAO,
  author =       "Matthias M{\"u}ller-Hannemann and Anna Schulze",
  title =        "Hardness and Approximation of Octilinear {Steiner}
                 Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "3",
  pages =        "231--260",
  month =        jun,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819590700232X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wu:2007:LNS,
  author =       "Xiaodong Wu and Danny Z. Chen and Kang Li and Milan
                 Sonka",
  title =        "The Layered Net Surface Problems in Discrete Geometry
                 and Medical Image Segmentation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "3",
  pages =        "261--296",
  month =        jun,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002331",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Devillers:2007:MVI,
  author =       "Olivier Devillers and Vida Dujmovi{\'c} and Hazel
                 Everett and Samuel Hornus and Sue Whitesides and Steve
                 Wismath",
  title =        "Maintaining Visibility Information of Planar Point
                 Sets with a Moving Viewpoint",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "4",
  pages =        "297--304",
  month =        aug,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002343",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Rahi:2007:MCS,
  author =       "Sahand Jamal Rahi and Kim Sharp",
  title =        "Mapping Complicated Surfaces Onto a Sphere",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "4",
  pages =        "305--329",
  month =        aug,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002355",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Moet:2007:RIT,
  author =       "Esther Moet and Marc {Van Kreveld} and Ren{\'e} {Van
                 Oostrum}",
  title =        "Region Intervisibility in Terrains",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "4",
  pages =        "331--347",
  month =        aug,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002367",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cheong:2007:PSQ,
  author =       "Otfried Cheong and Hazel Everett and Hyo-Sil Kim and
                 Sylvain Lazard and Ren{\'e} Schott",
  title =        "Parabola Separation Queries and Their Application to
                 Stone Throwing",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "4",
  pages =        "349--360",
  month =        aug,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002379",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Everett:2007:ESV,
  author =       "Hazel Everett and Sylvain Lazard and Sylvain Petitjean
                 and Linqiao Zhang",
  title =        "On the Expected Size of the {$2$D} Visibility
                 Complex",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "4",
  pages =        "361--381",
  month =        aug,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002380",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Milenkovic:2007:MCM,
  author =       "Victor Milenkovic and Elisha Sacks",
  title =        "A Monotonic Convolution for {Minkowski} Sums",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "4",
  pages =        "383--396",
  month =        aug,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002392",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ORourke:2007:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column 48",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "4",
  pages =        "397--399",
  month =        aug,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002409",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kobbelt:2007:GEF,
  author =       "Leif Kobbelt and Vadim Shapiro",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "5",
  pages =        "401--402",
  month =        oct,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002410",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chazal:2007:NMB,
  author =       "Frederic Chazal and Andre Lieutier and Jarek
                 Rossignac",
  title =        "Normal-Map Between Normal-Compatible Manifolds",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "5",
  pages =        "403--421",
  month =        oct,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002422",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Sud:2007:HPM,
  author =       "Avneesh Sud and Mark Foskey and Dinesh Manocha",
  title =        "Homotopy-Preserving Medial Axis Simplification",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "5",
  pages =        "423--451",
  month =        oct,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002434",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hanniel:2007:PVC,
  author =       "I. Hanniel and M. Ramanathan and G. Elber and M.-S.
                 Kim",
  title =        "Precise {Voronoi} Cell Extraction of Free-Form Planar
                 Piecewise {$ C^1 $}-Continuous Closed Rational Curves",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "5",
  pages =        "453--486",
  month =        oct,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002446",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Williams:2007:TMS,
  author =       "Jason Williams and Jarek Rossignac",
  title =        "Tightening: Morphological Simplification",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "5",
  pages =        "487--503",
  month =        oct,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002458",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Eisenbrand:2007:PTN,
  author =       "Friedrich Eisenbrand and Stefan Funke and Andreas
                 Karrenbauer and Joachim Reichel and Elmar Sch{\"o}mer",
  title =        "Packing a Truck --- Now With a Twist!",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "5",
  pages =        "505--527",
  month =        oct,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819590700246X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2007:GAA,
  author =       "Prosenjit Bose and Narc{\'i}s Coll and Ferran Hurtado
                 and J. Antoni Sellar{\`e}s",
  title =        "A General Approximation Algorithm for Planar Maps with
                 Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "6",
  pages =        "529--554",
  month =        dec,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002471",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Harrington:2007:OVD,
  author =       "Paul Harrington and Colm {\'O}. D{\'u}nlaing and Chee
                 K. Yap",
  title =        "Optimal {Voronoi} Diagram Construction With n Convex
                 Sites In Three Dimensions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "6",
  pages =        "555--593",
  month =        dec,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002483",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Atalay:2007:PIH,
  author =       "F. Betul Atalay and David M. Mount",
  title =        "Pointerless Implementation of Hierarchical Simplicial
                 Meshes and Efficient Neighbor Finding in Arbitrary
                 Dimensions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "6",
  pages =        "595--631",
  month =        dec,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002495",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2007:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 17 (2007)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "17",
  number =       "6",
  pages =        "633--635",
  month =        dec,
  year =         "2007",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195907002495",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Efrat:2008:GEF,
  author =       "Alon Efrat",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "1-2",
  pages =        "1--2",
  month =        apr,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002519",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Frahling:2008:SDD,
  author =       "Gereon Frahling and Piotr Indyk and Christian Sohler",
  title =        "Sampling in Dynamic Data Streams and Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "1-2",
  pages =        "3--28",
  month =        apr,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002520",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dey:2008:CPD,
  author =       "Tamal K. Dey and Joachim Giesen and Edgar A. Ramos and
                 Bardia Sadri",
  title =        "Critical Points of Distance to an {$ \epsilon
                 $}-Sampling of a Surface and Flow-Complex-Based Surface
                 Reconstruction",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "1-2",
  pages =        "29--61",
  month =        apr,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002532",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2008:MRB,
  author =       "Danny Z. Chen and Xiaobo S. Hu and Chao Wang and
                 Shuang Luan and Xiaodong Wu",
  title =        "Mountain Reduction, Block Matching, and Applications
                 in Intensity-Modulated Radiation Therapy",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "1-2",
  pages =        "63--106",
  month =        apr,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002544",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Eisenbrand:2008:EAS,
  author =       "Friedrich Eisenbrand and Stefan Funke and Andreas
                 Karrenbauer and Domagoj Matijevic",
  title =        "Energy-Aware Stage Illumination",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "1-2",
  pages =        "107--129",
  month =        apr,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002556",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Eppstein:2008:SQD,
  author =       "David Eppstein and Michael T. Goodrich and Jonathan Z.
                 Sun",
  title =        "Skip Quadtrees: Dynamic Data Structures for
                 Multidimensional Point Sets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "1-2",
  pages =        "131--160",
  month =        apr,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002568",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Durocher:2008:BVA,
  author =       "Stephane Durocher and David Kirkpatrick",
  title =        "Bounded-Velocity Approximation of Mobile {Euclidean}
                 2-Centres",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "3",
  pages =        "161--183",
  month =        jun,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819590800257X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Borgelt:2008:FPA,
  author =       "Magdalene Grantson Borgelt and Christian Borgelt and
                 Christos Levcopoulos",
  title =        "Fixed Parameter Algorithms for the Minimum Weight
                 Triangulation Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "3",
  pages =        "185--220",
  month =        jun,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002581",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Heimlich:2008:BAS,
  author =       "Martin Heimlich and Martin Held",
  title =        "Biarc Approximation, Simplification and Smoothing of
                 Polygonal Curves by Means of {Voronoi}-Based Tolerance
                 Bands",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "3",
  pages =        "221--250",
  month =        jun,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002593",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Frati:2008:MAP,
  author =       "Fabrizio Frati",
  title =        "On Minimum Area Planar Upward Drawings of Directed
                 Trees and Other Families of Directed Acyclic Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "3",
  pages =        "251--271",
  month =        jun,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819590800260X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Sugihara:2008:GEF,
  author =       "Kokichi Sugihara and Deok-Soo Kim",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "4",
  pages =        "273--274",
  month =        aug,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002611",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gorke:2008:CCV,
  author =       "Robert G{\"o}rke and Chan-Su Shin and Alexander
                 Wolff",
  title =        "Constructing the City {Voronoi} Diagram Faster",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "4",
  pages =        "275--294",
  month =        aug,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002623",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Abellanas:2008:HLM,
  author =       "Manuel Abellanas and Ferran Hurtado and Bel{\'e}n
                 Palop",
  title =        "The Heavy Luggage Metric",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "4",
  pages =        "295--306",
  month =        aug,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002635",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Alt:2008:CHD,
  author =       "Helmut Alt and Ludmila Scharf",
  title =        "Computing the {Hausdorff} Distance Between Curved
                 Objects",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "4",
  pages =        "307--320",
  month =        aug,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002647",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hiyoshi:2008:SCN,
  author =       "Hisamoto Hiyoshi",
  title =        "Stable Computation of Natural Neighbor Interpolation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "4",
  pages =        "321--341",
  month =        aug,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002659",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Liu:2008:FPS,
  author =       "Yuanxin Liu and Jack Snoeyink",
  title =        "Faraway Point: a Sentinel Point for {Delaunay}
                 Computation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "4",
  pages =        "343--355",
  month =        aug,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002660",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Shin:2008:VDP,
  author =       "Hayong Shin and Seyoun Park and Eonjin Park and
                 Deok-Soo Kim",
  title =        "{Voronoi} Diagram of a Polygon in Chessboard Metric
                 and Maskless Lithographic Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "4",
  pages =        "357--371",
  month =        aug,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002672",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bereg:2008:SDP,
  author =       "Sergey Bereg and Adrian Dumitrescu and J{\'a}nos
                 Pach",
  title =        "Sliding Disks in the Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "5",
  pages =        "373--387",
  month =        oct,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002684",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fu:2008:MDW,
  author =       "Bin Fu and Sorinel A. Oprisan and Lizhe Xu",
  title =        "Multi-Directional Width-Bounded Geometric Separator
                 and Protein Folding",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "5",
  pages =        "389--413",
  month =        oct,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002696",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cheng:2008:PDD,
  author =       "Siu-Wing Cheng and Yajun Wang and Zhuangzhi Wu",
  title =        "Provable Dimension Detection Using Principal Component
                 Analysis",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "5",
  pages =        "415--440",
  month =        oct,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002702",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Scorzelli:2008:PSM,
  author =       "Giorgio Scorzelli and Alberto Paoluzzi and Valerio
                 Pascucci",
  title =        "Parallel Solid Modeling Using {BSP} Dataflow",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "5",
  pages =        "441--467",
  month =        oct,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002714",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Barequet:2008:MP,
  author =       "Gill Barequet and Aya Steiner",
  title =        "On the Matability of Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "5",
  pages =        "469--506",
  month =        oct,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002726",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Amenta:2008:GEF,
  author =       "Nina Amenta and Otfried Cheong",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "6",
  pages =        "507--508",
  month =        dec,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002738",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Labelle:2008:SRL,
  author =       "Fran{\c{c}}ois Labelle",
  title =        "Sliver Removal by Lattice Refinement",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "6",
  pages =        "509--532",
  month =        dec,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819590800274X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Giesen:2008:MAA,
  author =       "Joachim Giesen and Edgar A. Ramos and Bardia Sadri",
  title =        "Medial Axis Approximation and Unstable Flow Complex",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "6",
  pages =        "533--565",
  month =        dec,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002751",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Emiris:2008:PEV,
  author =       "Ioannis Z. Emiris and Elias P. Tsigaridas and George
                 M. Tzoumas",
  title =        "The Predicates for the Exact {Voronoi} Diagram of
                 Ellipses Under the {Euclidean} Metric",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "6",
  pages =        "567--597",
  month =        dec,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002763",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Alon:2008:CFC,
  author =       "Noga Alon and Shakhar Smorodinsky",
  title =        "Conflict-Free Colorings of Shallow Discs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "6",
  pages =        "599--604",
  month =        dec,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002775",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Frahling:2008:FKM,
  author =       "Gereon Frahling and Christian Sohler",
  title =        "A Fast $k$-Means Implementation Using Coresets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "6",
  pages =        "605--625",
  month =        dec,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002787",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2008:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 18 (2008)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "18",
  number =       "6",
  pages =        "627--629",
  month =        dec,
  year =         "2008",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195908002787",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Asano:2009:GEF,
  author =       "Tetsuo Asano",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "2",
  pages =        "93--93",
  month =        apr,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002848",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bae:2009:OCC,
  author =       "Sang Won Bae and Jae-Hoon Kim and Kyung-Yong Chwa",
  title =        "Optimal Construction of the City {Voronoi} Diagram",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "2",
  pages =        "95--117",
  month =        apr,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819590900285X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2009:DDT,
  author =       "Prosenjit Bose and Michiel Smid and Daming Xu",
  title =        "{Delaunay} and Diamond Triangulations Contain Spanners
                 of Bounded Degree",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "2",
  pages =        "119--140",
  month =        apr,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002861",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wu:2009:EAOa,
  author =       "Xiaodong Wu",
  title =        "Efficient Algorithms for the Optimal-Ratio Region
                 Detection Problems in Discrete Geometry with
                 Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "2",
  pages =        "141--159",
  month =        apr,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002873",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wang:2009:RBT,
  author =       "Yusu Wang",
  title =        "Relations Between Two Common Types of Rectangular
                 Tilings",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "2",
  pages =        "161--172",
  month =        apr,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002885",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Elbassioni:2009:AAE,
  author =       "Khaled Elbassioni and Aleksei V. Fishkin and Ren{\'e}
                 Sitters",
  title =        "Approximation Algorithms for the {Euclidean} Traveling
                 Salesman Problem with Discrete and Continuous
                 Neighborhoods",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "2",
  pages =        "173--193",
  month =        apr,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002897",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dillard:2009:TGT,
  author =       "Scott E. Dillard and Vijay Natarajan and Gunther H.
                 Weber and Valerio Pascucci and Bernd Hamann",
  title =        "Topology-Guided Tessellation Of Quadratic Elements",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "2",
  pages =        "195--211",
  month =        apr,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002903",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2009:EF,
  author =       "Danny Z. Chen and D. T. Lee",
  title =        "Editors' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "3",
  pages =        "213--214",
  month =        jun,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002915",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aleksandrowicz:2009:CDD,
  author =       "Gadi Aleksandrowicz and Gill Barequet",
  title =        "Counting $d$-Dimensional Polycubes and Nonrectangular
                 Planar Polyominoes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "3",
  pages =        "215--229",
  month =        jun,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002927",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wu:2009:EAOb,
  author =       "Xiaodong Wu and Xin Dou and John E. Bayouth and John
                 M. Buatti",
  title =        "Efficient Algorithm for Optimal Matrix Orthogonal
                 Decomposition Problem in Intensity-Modulated Radiation
                 Therapy",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "3",
  pages =        "231--246",
  month =        jun,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002939",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Andersson:2009:RMS,
  author =       "Mattias Andersson and Joachim Gudmundsson and Christos
                 Levcopoulos",
  title =        "Restricted Mesh Simplification Using Edge
                 Contractions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "3",
  pages =        "247--265",
  month =        jun,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002940",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Benkert:2009:PTA,
  author =       "Marc Benkert and Joachim Gudmundsson and Christian
                 Knauer and Ren{\'e} Van Oostrum and Alexander Wolff",
  title =        "A Polynomial-Time Approximation Algorithm for a
                 Geometric Dispersion Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "3",
  pages =        "267--288",
  month =        jun,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002952",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Poon:2009:ULP,
  author =       "Sheung-Hung Poon",
  title =        "On Unfolding Lattice Polygons\slash Trees and
                 Diameter-4 Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "3",
  pages =        "289--321",
  month =        jun,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002964",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Rokne:2009:GEF,
  author =       "Jon Rokne",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "4",
  pages =        "323--324",
  month =        aug,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002976",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Porschen:2009:RCP,
  author =       "Stefan Porschen",
  title =        "On Rectangular Covering Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "4",
  pages =        "325--340",
  month =        aug,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909002988",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gavrilova:2009:DSM,
  author =       "Marina L. Gavrilova",
  title =        "Determining a Set of Maximum Inscribed Rectangles for
                 Label Placement in a Region",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "4",
  pages =        "341--356",
  month =        aug,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819590900299X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bardhan:2009:GPM,
  author =       "Debabrata Bardhan and Sansanka Roy and Sandip Das",
  title =        "Guard Placement for Maximizing {$L$}-Visibility
                 Exterior to a Convex Polygon",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "4",
  pages =        "357--370",
  month =        aug,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003003",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Jiang:2009:FPA,
  author =       "D. Jiang and N. F. Stewart",
  title =        "Floating-Point Arithmetic for Computational Geometry
                 Problems with Uncertain Data",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "4",
  pages =        "371--385",
  month =        aug,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003015",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kim:2009:GEF,
  author =       "Deok-Soo Kim",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "5",
  pages =        "387--388",
  month =        oct,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003027",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Nielsen:2009:ASE,
  author =       "Frank Nielsen and Richard Nock",
  title =        "Approximating Smallest Enclosing Balls with
                 Applications to Machine Learning",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "5",
  pages =        "389--414",
  month =        oct,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003039",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gavrilova:2009:ESC,
  author =       "Marina L. Gavrilova",
  title =        "An Explicit Solution for Computing the Vertices of the
                 {Euclidean} $d$-Dimensional {Voronoi} Diagram of
                 Spheres in a Floating-Point Arithmetic",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "5",
  pages =        "415--424",
  month =        oct,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003040",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Nishida:2009:BSV,
  author =       "Tetsushi Nishida and Kokichi Sugihara",
  title =        "Boat-Sail {Voronoi} Diagram and Its Application",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "5",
  pages =        "425--440",
  month =        oct,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003052",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bekker:2009:RTC,
  author =       "Henk Bekker and Axel A. Brink and Jos B. T. M.
                 Roerdink",
  title =        "Reducing the Time Complexity and Identifying Ill-Posed
                 Problem Instances of {Minkowski} Sum Based Similarity
                 Calculations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "5",
  pages =        "441--456",
  month =        oct,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003064",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Das:2009:SCS,
  author =       "Sandip Das and Partha P. Goswami and Subhas C. Nandy",
  title =        "Smallest Color-Spanning Object Revisited",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "5",
  pages =        "457--478",
  month =        oct,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003076",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gupta:2009:ENI,
  author =       "Prosenjit Gupta and Ravi Janardan and Michiel Smid",
  title =        "Efficient Non-Intersection Queries on Aggregated
                 Geometric Data",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "6",
  pages =        "479--506",
  month =        dec,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003088",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cardinal:2009:PGT,
  author =       "Jean Cardinal and Martine Labb{\'e} and Stefan
                 Langerman and Bel{\'e}n Palop",
  title =        "Pricing Geometric Transportation Networks",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "6",
  pages =        "507--520",
  month =        dec,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819590900309X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Sangwin:2009:DBM,
  author =       "C. J. Sangwin",
  title =        "Deceiving the {$V$}-Block Method for Assessment of
                 Departure from Roundness",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "6",
  pages =        "521--532",
  month =        dec,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003106",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cabello:2009:MAO,
  author =       "Sergio Cabello and Mark {De Berg} and Panos
                 Giannopoulos and Christian Knauer and Ren{\'e} {Van
                 Oostrum} and Remco C. Veltkamp",
  title =        "Maximizing the Area of Overlap of Two Unions of Disks
                 Under Rigid Motion",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "6",
  pages =        "533--556",
  month =        dec,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003118",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mukhopadhyay:2009:ISI,
  author =       "Asish Mukhopadhyay and Eugene Greene and S. V. Rao",
  title =        "On Intersecting a Set of Isothetic Line Segments with
                 a Convex Polygon of Minimum Area",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "6",
  pages =        "557--577",
  month =        dec,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819590900312X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dinitz:2009:GRP,
  author =       "Yefim Dinitz and Matthew J. Katz and Roi Krakovski",
  title =        "Guarding Rectangular Partitions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "6",
  pages =        "579--594",
  month =        dec,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003131",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Abellanas:2009:SGT,
  author =       "Manuel Abellanas and Prosenjit Bose and Jes{\'u}s
                 Garc{\'i}a and Ferran Hurtado and Carlos M. Nicol{\'a}s
                 and Pedro Ramos",
  title =        "On Structural and Graph Theoretic Properties of Higher
                 Order {Delaunay} Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "6",
  pages =        "595--615",
  month =        dec,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003143",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2009:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 19 (2009)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "19",
  number =       "6",
  pages =        "617--619",
  month =        dec,
  year =         "2009",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195909003143",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tokuyama:2010:F,
  author =       "Takeshi Tokuyama",
  title =        "Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "1",
  pages =        "1--2",
  month =        feb,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003165",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2010:GSA,
  author =       "Eric Y. Chen",
  title =        "Geometric Streaming Algorithm with a Sorting
                 Primitive",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "1",
  pages =        "3--18",
  month =        feb,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003177",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Benkert:2010:FPP,
  author =       "Marc Benkert and Bojan Djordjevic and Joachim
                 Gudmundsson and Thomas Wolle",
  title =        "Finding Popular Places",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "1",
  pages =        "19--42",
  month =        feb,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003189",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Xu:2010:GSS,
  author =       "Jinhui Xu and Yang Yang and Yongding Zhu and Naoki
                 Katoh",
  title =        "A Geometric Spanner of Segments",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "1",
  pages =        "43--67",
  month =        feb,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003190",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ahn:2010:DOE,
  author =       "Hee-Kap Ahn and Mohammad Farshi and Christian Knauer
                 and Michiel Smid and Yajun Wang",
  title =        "Dilation-Optimal Edge Deletion in Polygonal Cycles",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "1",
  pages =        "69--87",
  month =        feb,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003207",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aronov:2010:OTP,
  author =       "Boris Aronov and Tetsuo Asano and Stefan Funke",
  title =        "Optimal Triangulations of Points and Segments with
                 {Steiner} Points",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "1",
  pages =        "89--104",
  month =        feb,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003219",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bereg:2010:MAI,
  author =       "Sergey Bereg and Adrian Dumitrescu and Minghui Jiang",
  title =        "Maximum Area Independent Sets in Disk Intersection
                 Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "2",
  pages =        "105--118",
  month =        apr,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003220",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wang:2010:GWR,
  author =       "Pengpeng Wang and Ramesh Krishnamurti and Kamal
                 Gupta",
  title =        "Generalized Watchman Route Problem with Discrete View
                 Cost",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "2",
  pages =        "119--146",
  month =        apr,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003232",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Giannopoulos:2010:CGM,
  author =       "Panos Giannopoulos and Rolf Klein and Christian Knauer
                 and Martin Kutz and D{\'a}niel Marx",
  title =        "Computing Geometric Minimum-Dilation Graphs Is
                 {NP}-Hard",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "2",
  pages =        "147--173",
  month =        apr,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003244",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kameda:2010:FAD,
  author =       "Tsunehiko Kameda and John Z. Zhang",
  title =        "Finding All Door Locations That Make a Room
                 Searchable",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "2",
  pages =        "175--201",
  month =        apr,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003256",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{DeBerg:2010:OBR,
  author =       "Mark {De Berg} and Elena Mumford and Bettina
                 Speckmann",
  title =        "Optimal {BSPs} and Rectilinear Cartograms",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "2",
  pages =        "203--222",
  month =        apr,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003268",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Zak:2010:DPC,
  author =       "Andrzej {\.Z}ak",
  title =        "Dissections of Polygons into Convex Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "2",
  pages =        "223--244",
  month =        apr,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591000327X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Demaine:2010:GVU,
  author =       "Erik D. Demaine and John Iacono and Stefan Langerman",
  title =        "Grid Vertex-Unfolding Orthostacks",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "3",
  pages =        "245--254",
  month =        jun,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003281",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gabriely:2010:CCM,
  author =       "Yoav Gabriely and Elon Rimon",
  title =        "Competitive Complexity of Mobile Robot On-Line Motion
                 Planning Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "3",
  pages =        "255--283",
  month =        jun,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003293",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chazal:2010:BMH,
  author =       "Fr{\'e}d{\'e}ric Chazal and Andr{\'e} Lieutier and
                 Jarek Rossignac and Brian Whited",
  title =        "Ball-Map: Homeomorphism Between Compatible Surfaces",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "3",
  pages =        "285--306",
  month =        jun,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591000330X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kamphans:2010:LUM,
  author =       "Tom Kamphans and Elmar Langetepe",
  title =        "Leaving an Unknown Maze Using an Error-Prone Compass",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "3",
  pages =        "307--325",
  month =        jun,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003311",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Brass:2010:GPT,
  author =       "Peter Brass and Hyeon-Suk Na and Chan-Su Shin",
  title =        "Guarding a Polygon from Two Nearly-Opposite
                 Directions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "3",
  pages =        "327--339",
  month =        jun,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003323",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Brass:2010:LBA,
  author =       "Peter Brass and Ferran Hurtado and Benjamin Lafreniere
                 and Anna Lubiw",
  title =        "A Lower Bound on the Area of a 3-Coloured Disk
                 Packing",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "3",
  pages =        "341--360",
  month =        jun,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003335",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Silveira:2010:FCD,
  author =       "Rodrigo I. Silveira and Ren{\'e} {Van Oostrum}",
  title =        "Flooding Countries and Destroying Dams",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "3",
  pages =        "361--380",
  month =        jun,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003347",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Aug 30 10:25:06 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gray:2010:SIT,
  author =       "Chris Gray and Maarten L{\"o}ffler and Rodrigo I.
                 Silveira",
  title =        "Smoothing Imprecise {$ 1.5 $D} Terrains",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "4",
  pages =        "381--414",
  month =        aug,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003359",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Sep 17 08:34:39 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kapoor:2010:PSG,
  author =       "Sanjiv Kapoor and Xiang-Yang Li",
  title =        "Proximity Structures for Geometric Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "4",
  pages =        "415--429",
  month =        aug,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003360",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Sep 17 08:34:39 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kumar:2010:AOS,
  author =       "Pankaj Kumar and Piyush Kumar",
  title =        "Almost Optimal Solutions To $k$-Clustering Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "4",
  pages =        "431--447",
  month =        aug,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003372",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Sep 17 08:34:39 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2010:FMO,
  author =       "Danny Z. Chen and Ewa Misio{\l}ek",
  title =        "Finding Many Optimal Paths Without Growing Any Optimal
                 Path Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "4",
  pages =        "449--469",
  month =        aug,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003384",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Sep 17 08:34:39 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bereg:2010:VDP,
  author =       "Sergey Bereg and Kevin Buchin and Maike Buchin and
                 Marina Gavrilova and Binhai Zhu",
  title =        "{Voronoi} Diagram of Polygonal Chains Under the
                 Discrete {Fr{\'e}chet} Distance",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "4",
  pages =        "471--484",
  month =        aug,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003396",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Sep 17 08:34:39 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Milenkovic:2010:TAM,
  author =       "Victor Milenkovic and Elisha Sacks",
  title =        "Two Approximate {Minkowski} Sum Algorithms",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "4",
  pages =        "485--509",
  month =        aug,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003402",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Sep 17 08:34:39 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anghinolfi:2010:CPR,
  author =       "Andrea Anghinolfi and Luca Costa and Massimo Ferri and
                 Enrico Viarani",
  title =        "A Covering Projection for Robot Navigation Under
                 Strong Anisotropy",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "5",
  pages =        "511--525",
  month =        oct,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003414",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Nov 2 18:56:35 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kano:2010:BSB,
  author =       "M. Kano and Miyuki Uno",
  title =        "Balanced Subdivisions with Boundary Condition of Two
                 Sets of Points in the Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "5",
  pages =        "527--541",
  month =        oct,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003426",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Nov 2 18:56:35 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Unnikrishnan:2010:SSG,
  author =       "Ranjith Unnikrishnan and Jean-Fran{\c{c}}ois Lalonde
                 and Nicolas Vandapel and Martial Hebert",
  title =        "Scale Selection for Geometric Fitting in Noisy Point
                 Clouds",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "5",
  pages =        "543--575",
  month =        oct,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003438",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Nov 2 18:56:35 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Giacomo:2010:CPS,
  author =       "Emilio {Di Giacomo} and Walter Didimo and Giuseppe
                 Liotta and Henk Meijer and Stephen K. Wismath",
  title =        "Constrained Point-Set Embeddability of Planar Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "5",
  pages =        "577--600",
  month =        oct,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591000344X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Nov 2 18:56:35 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Amit:2010:LGV,
  author =       "Yoav Amit and Joseph S. B. Mitchell and Eli Packer",
  title =        "Locating Guards for Visibility Coverage of Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "5",
  pages =        "601--630",
  month =        oct,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003451",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Nov 2 18:56:35 MDT 2010",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Sitharam:2010:RCC,
  author =       "Meera Sitharam and Yong Zhou and J{\"o}rg Peters",
  title =        "Reconciling Conflicting Combinatorial Preprocessors
                 for Geometric Constraint Systems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "6",
  pages =        "631--651",
  month =        dec,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003463",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Feb 18 10:39:51 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kramer:2010:MOM,
  author =       "Josh Brown Kramer and Lucas Sabalka",
  title =        "Multidimensional Online Motion Planning for a
                 Spherical Robot",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "6",
  pages =        "653--684",
  month =        dec,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003475",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Feb 18 10:39:51 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Jackson:2010:OPG,
  author =       "Bill Jackson and Tibor Jord{\'a}n",
  title =        "Operations Preserving Global Rigidity of Generic
                 Direction-Length Frameworks",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "6",
  pages =        "685--706",
  month =        dec,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003487",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Feb 18 10:39:51 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chepoi:2010:PES,
  author =       "Victor Chepoi and Karim Nouioua and Edouard Thiel and
                 Yann Vax{\`e}s",
  title =        "{Pareto} Envelopes in Simple Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "6",
  pages =        "707--721",
  month =        dec,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003499",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Feb 18 10:39:51 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Owen:2010:FSR,
  author =       "J. C. Owen and S. C. Power",
  title =        "Frameworks Symmetry and Rigidity",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "6",
  pages =        "723--750",
  month =        dec,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003505",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Feb 18 10:39:51 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2010:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 20 (2010)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "20",
  number =       "6",
  pages =        "751--754",
  month =        dec,
  year =         "2010",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195910003505",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Feb 18 10:39:51 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Loffler:2011:ECT,
  author =       "Maarten L{\"o}ffler",
  title =        "Existence and Computation of Tours Through Imprecise
                 Points",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "1",
  pages =        "1--24",
  month =        feb,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003524",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 11 16:36:45 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2011:CEI,
  author =       "Prosenjit Bose and Merc{\`e} Mora and Carlos Seara and
                 Saurabh Sethia",
  title =        "On Computing Enclosing Isosceles Triangles and Related
                 Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "1",
  pages =        "25--45",
  month =        feb,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003536",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 11 16:36:45 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aichholzer:2011:CSA,
  author =       "Oswin Aichholzer and Franz Aurenhammer and Thomas
                 Hackl and Bert J{\"u}ttler and Margot Rabl and Zbynek
                 {\v{S}}{\'\i}r",
  title =        "Computational and Structural Advantages of Circular
                 Boundary Representation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "1",
  pages =        "47--69",
  month =        feb,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003548",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 11 16:36:45 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Alam:2011:CNP,
  author =       "Md. Ashraful Alam and Masud Hasan",
  title =        "Computing Nice Projections of Convex Polyhedra",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "1",
  pages =        "71--85",
  month =        feb,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591100355X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 11 16:36:45 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aloupis:2011:CSP,
  author =       "Greg Aloupis and Prosenjit Bose and Erik D. Demaine
                 and Stefan Langerman and Henk Meijer and Mark Overmars
                 and Godfried T. Toussaint",
  title =        "Computing Signed Permutations of Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "1",
  pages =        "87--100",
  month =        feb,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003561",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 11 16:36:45 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Obermeyer:2011:CAS,
  author =       "Karl J. Obermeyer and Anurag Ganguli and Francesco
                 Bullo",
  title =        "A Complete Algorithm for Searchlight Scheduling",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "1",
  pages =        "101--130",
  month =        feb,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003573",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 11 16:36:45 MST 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Reif:2011:AOK,
  author =       "John Reif and Sam Slee",
  title =        "Asymptotically Optimal Kinodynamic Motion Planning for
                 a Class of Modular Self-Reconfigurable Robots",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "2",
  pages =        "131--155",
  month =        apr,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003585",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Apr 12 14:59:21 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Brass:2011:ACP,
  author =       "Peter Brass and Christian Knauer and Hyeon-Suk Na and
                 Chan-Su Shin and Antoine Vigneron",
  title =        "The Aligned {$K$}-Center Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "2",
  pages =        "157--178",
  month =        apr,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003597",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Apr 12 14:59:21 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cheong:2011:RNN,
  author =       "Otfried Cheong and Antoine Vigneron and Juyoung Yon",
  title =        "Reverse Nearest Neighbor Queries in Fixed Dimension",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "2",
  pages =        "179--188",
  month =        apr,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003603",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Apr 12 14:59:21 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Estivill-Castro:2011:FAM,
  author =       "Vladimir Estivill-Castro and Apichat Heednacram and
                 Francis Suraweera",
  title =        "{FPT}-Algorithms for Minimum-Bends Tours",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "2",
  pages =        "189--213",
  month =        apr,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003615",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Apr 12 14:59:21 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  note =         "See errata \cite{Estivill-Castro:2015:IFC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Biedl:2011:RCP,
  author =       "Therese Biedl and Masud Hasan and Alejandro
                 L{\'o}pez-Ortiz",
  title =        "Reconstructing Convex Polygons and Convex Polyhedra
                 from Edge and Face Counts in Orthogonal Projections",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "2",
  pages =        "215--239",
  month =        apr,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003627",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Apr 12 14:59:21 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Katz:2011:GOA,
  author =       "Matthew J. Katz and Gila Morgenstern",
  title =        "Guarding Orthogonal Art Galleries with Sliding
                 Cameras",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "2",
  pages =        "241--250",
  month =        apr,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003639",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Apr 12 14:59:21 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hong:2011:GEF,
  author =       "Seok-Hee Hong and Hiroshi Nagamochi",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "3",
  pages =        "251--252",
  month =        jun,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003640",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 8 14:48:51 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Buchin:2011:DCP,
  author =       "Kevin Buchin and Maike Buchin and Joachim Gudmundsson
                 and Maarten L{\"o}ffler and Jun Luo",
  title =        "Detecting Commuting Patterns by Clustering
                 Subtrajectories",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "3",
  pages =        "253--282",
  month =        jun,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003652",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 8 14:48:51 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Luo:2011:MSS,
  author =       "Cheng-Wei Luo and Hsiao-Fei Liu and Peng-An Chen and
                 Kun-Mao Chao",
  title =        "{Minkowski} Sum Selection and Finding",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "3",
  pages =        "283--311",
  month =        jun,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003664",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 8 14:48:51 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kim:2011:CPS,
  author =       "Sang-Sub Kim and Sang Won Bae and Hee-Kap Ahn",
  title =        "Covering a Point Set by Two Disjoint Rectangles",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "3",
  pages =        "313--330",
  month =        jun,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003676",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 8 14:48:51 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Guo:2011:GCA,
  author =       "Zeyu Guo and He Sun and Hong Zhu",
  title =        "Greedy Construction of 2-Approximate Minimum
                 {Manhattan} Networks",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "3",
  pages =        "331--350",
  month =        jun,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003688",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 8 14:48:51 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Scharf:2011:IPL,
  author =       "Ludmila Scharf and Marc Scherfenberg",
  title =        "Inducing Polygons of Line Arrangements",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "3",
  pages =        "351--368",
  month =        jun,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591100369X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 8 14:48:51 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Knauer:2011:ANN,
  author =       "Christian Knauer and Marc Scherfenberg",
  title =        "Approximate Nearest Neighbor Search Under Translation
                 Invariant {Hausdorff} Distance",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "3",
  pages =        "369--381",
  month =        jun,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003706",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 8 14:48:51 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Biedl:2011:STO,
  author =       "Therese Biedl and Burkay Gen{\c{c}}",
  title =        "{Stoker}'s Theorem for Orthogonal Polyhedra",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "4",
  pages =        "383--391",
  month =        aug,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003718",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 24 06:54:16 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aleardi:2011:CBR,
  author =       "Luca Castelli Aleardi and Olivier Devillers and
                 Abdelkrim Mebarki",
  title =        "Catalog-Based Representation of {$2$D}
                 Triangulations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "4",
  pages =        "393--402",
  month =        aug,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591100372X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 24 06:54:16 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Batog:2011:IBN,
  author =       "Guillaume Batog and Xavier Goaoc",
  title =        "Inflating Balls is {NP}-Hard",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "4",
  pages =        "403--415",
  month =        aug,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003731",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 24 06:54:16 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chuon:2011:SCB,
  author =       "Chansophea Chuon and Sumanta Guha and Paul Janecek and
                 Nguyen Duc Cong Song",
  title =        "{Simplipoly}: Curvature-Based Polygonal Curve
                 Simplification",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "4",
  pages =        "417--429",
  month =        aug,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003743",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 24 06:54:16 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ahmed:2011:SDP,
  author =       "Mustaq Ahmed and Anna Lubiw",
  title =        "Shortest Descending Paths: Towards an Exact
                 Algorithm",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "4",
  pages =        "431--466",
  month =        aug,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003755",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 24 06:54:16 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Santos:2011:EDL,
  author =       "Thiago R. {Dos Santos} and Hans-Peter Meinzer and Lena
                 Maier-Hein",
  title =        "Extending the Doubly Linked Face List for the
                 Representation of 2-Pseudomanifolds and 2-Manifolds
                 with Boundaries",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "4",
  pages =        "467--494",
  month =        aug,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003767",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 24 06:54:16 MDT 2011",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Elbassioni:2011:FSC,
  author =       "Khaled Elbassioni and Amr Elmasry and Kazuhisa
                 Makino",
  title =        "Finding Simplices Containing the Origin in Two and
                 Three Dimensions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "5",
  pages =        "495--506",
  month =        oct,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003779",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:46 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Rand:2011:DRA,
  author =       "Alexander Rand and Noel Walkington",
  title =        "{Delaunay} Refinement Algorithms for Estimating Local
                 Feature Size in {$2$D} and {$3$D}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "5",
  pages =        "507--543",
  month =        oct,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003780",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:46 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Berkoff:2011:PIS,
  author =       "A. M. Berkoff and J. M. Henle and A. E. Mcdonough and
                 A. P. Wesolowski",
  title =        "Possibilities and Impossibilities in Square-Tiling",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "5",
  pages =        "545--558",
  month =        oct,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003792",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:46 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{DaFonseca:2011:FFP,
  author =       "Guilherme D. {Da Fonseca}",
  title =        "Fitting Flats to Points with Outliers",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "5",
  pages =        "559--569",
  month =        oct,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003809",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:46 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gosselin:2011:CCD,
  author =       "Serge Gosselin and Carl Ollivier-Gooch",
  title =        "Constructing Constrained {Delaunay}
                 Tetrahedralizations of Volumes Bounded by Piecewise
                 Smooth Surfaces",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "5",
  pages =        "571--594",
  month =        oct,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003810",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:46 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Borgelt:2011:GDC,
  author =       "Magdalene G. Borgelt and Marc {Van Kreveld} and Jun
                 Luo",
  title =        "Geodesic Disks and Clustering in a Simple Polygon",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "6",
  pages =        "595--608",
  month =        dec,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003822",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:47 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2011:FFS,
  author =       "Danny Z. Chen and Ewa Misio{\l}ek",
  title =        "Free-Form Surface Partition in {$3$-D}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "6",
  pages =        "609--634",
  month =        dec,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003834",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:47 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{ElOraiby:2011:CTS,
  author =       "Wael {El Oraiby} and Dominique Schmitt and Jean-Claude
                 Spehner",
  title =        "Centroid Triangulations From $k$-Sets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "6",
  pages =        "635--659",
  month =        dec,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003846",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:47 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aota:2011:AAL,
  author =       "Hirofumi Aota and Takuro Fukunaga and Hiroshi
                 Nagamochi",
  title =        "An Approximation Algorithm for Locating Maximal Disks
                 Within Convex Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "6",
  pages =        "661--684",
  month =        dec,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195911003858",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:47 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Abu-Affash:2011:MCP,
  author =       "A. Karim Abu-Affash and Paz Carmi and Matthew J. Katz
                 and Gila Morgenstern",
  title =        "Multi Cover of a Polygon Minimizing the Sum of Areas",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "6",
  pages =        "685--698",
  month =        dec,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591100386X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:47 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2011:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 21 (2011)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "21",
  number =       "6",
  pages =        "699--702",
  month =        dec,
  year =         "2011",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591100386X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 15 11:44:47 MST 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cheong:2012:GEF,
  author =       "Otfried Cheong and Yoshio Okamoto",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "1",
  pages =        "1--??",
  month =        feb,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912020013",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:19 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bae:2012:ODV,
  author =       "Sang Won Bae and Chan-Su Shin",
  title =        "The Onion Diagram: a {Voronoi}-Like Tessellation of a
                 Planar Line Space and Its Applications",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "1",
  pages =        "3--??",
  month =        feb,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912600011",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:19 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ahn:2012:CDF,
  author =       "Hee-Kap Ahn and Christian Knauer and Marc Scherfenberg
                 and Lena Schlipf and Antoine Vigneron",
  title =        "Computing the Discrete {Fr{\'e}chet} Distance with
                 Imprecise Input",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "1",
  pages =        "27--??",
  month =        feb,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912600023",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:19 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wulff-Nilsen:2012:CSF,
  author =       "Christian Wulff-Nilsen and Ansgar Gr{\"u}ne and Rolf
                 Klein and Elmar Langetepe and D. T. Lee and Tien-Ching
                 Lin and Sheung-Hung Poon and Teng-Kai Yu",
  title =        "Computing the Stretch Factor and Maximum Detour of
                 Paths, Trees, and Cycles in the Normed Space",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "1",
  pages =        "45--??",
  month =        feb,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912600035",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:19 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2012:PAY,
  author =       "Prosenjit Bose and Mirela Damian and Karim Dou{\"i}eb
                 and Joseph O'Rourke and Ben Seamone and Michiel Smid
                 and Stefanie Wuhrer",
  title =        "$ \pi / 2 $-Angle {Yao} graphs Are Spanners",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "1",
  pages =        "61--??",
  month =        feb,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912600047",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:19 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cheng:2012:ASH,
  author =       "Siu-Wing Cheng and Jiongxin Jin and Antoine Vigneron
                 and Yajun Wang",
  title =        "Approximate Shortest Homotopic Paths in Weighted
                 Regions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "1",
  pages =        "83--??",
  month =        feb,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912600059",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:19 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lingas:2012:LTA,
  author =       "Andrzej Lingas and Agnieszka Wasylewicz and Pawe{\l}
                 {\.Z}yli{\'n}ski",
  title =        "Linear-Time $3$-Approximation Algorithm for the
                 $r$-Star Covering Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "2",
  pages =        "103--??",
  month =        apr,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591250001X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:21 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Arkin:2012:SPS,
  author =       "Esther M. Arkin and Delia Garijo and Alberto
                 M{\'a}rquez and Joseph S. B. Mitchell and Carlos
                 Seara",
  title =        "Separability of Point Sets by $k$-Level Linear
                 Classification Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "2",
  pages =        "143--??",
  month =        apr,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500021",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:21 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Zernisch:2012:GTK,
  author =       "Jan B. Zernisch",
  title =        "A Generalization of a Theorem of {Kleitman} and
                 {Krieger}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "2",
  pages =        "167--??",
  month =        apr,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500033",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:21 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{DeBerg:2012:OBS,
  author =       "Mark {De Berg} and Amirali Khosravi",
  title =        "Optimal Binary Space Partitions for Segments in the
                 Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "3",
  pages =        "187--??",
  month =        jun,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500045",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:58:30 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Charlton:2012:GC,
  author =       "David Charlton and Erik D. Demaine and Martin L.
                 Demaine and Vida Dujmovi{\'c} and Pat Morin and Ryuhei
                 Uehara",
  title =        "Ghost Chimneys",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "3",
  pages =        "207--??",
  month =        jun,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500057",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:58:30 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2012:FSF,
  author =       "Danny Z. Chen and Haitao Wang",
  title =        "Fitting a Step Function to a Point Set with Outliers
                 Based on Simplicial Thickness Data Structures",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "3",
  pages =        "215--??",
  month =        jun,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500069",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:58:30 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Viglietta:2012:SPR,
  author =       "Giovanni Viglietta",
  title =        "Searching Polyhedra by Rotating Half-Planes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "3",
  pages =        "243--??",
  month =        jun,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500070",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:58:30 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hurtado:2012:GEF,
  author =       "Ferran Hurtado and Marc {Van Kreveld}",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "4",
  pages =        "277--??",
  month =        aug,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912020025",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:23 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Attali:2012:EDS,
  author =       "Dominique Attali and Andr{\'e} Lieutier and David
                 Salinas",
  title =        "Efficient Data Structure for Representing and
                 Simplifying Simplicial Complexes in High Dimensions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "4",
  pages =        "279--??",
  month =        aug,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912600060",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:23 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aanjaneya:2012:MGR,
  author =       "Mridul Aanjaneya and Frederic Chazal and Daniel Chen
                 and Marc Glisse and Leonidas Guibas and Dmitriy
                 Morozov",
  title =        "Metric Graph Reconstruction from Noisy Data",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "4",
  pages =        "305--??",
  month =        aug,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912600072",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:23 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Iacono:2012:SOT,
  author =       "John Iacono and Wolfgang Mulzer",
  title =        "A Static Optimality Transformation with Applications
                 to Planar Point Location",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "4",
  pages =        "327--??",
  month =        aug,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912600084",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:23 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chan:2012:TPA,
  author =       "Timothy M. Chan",
  title =        "Three Problems About Dynamic Convex Hulls",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "4",
  pages =        "341--??",
  month =        aug,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912600096",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:23 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gupta:2012:CSL,
  author =       "Rishi Gupta and Piotr Indyk and Eric Price and Yaron
                 Rachlin",
  title =        "Compressive Sensing with Local Geometric Features",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "4",
  pages =        "365--??",
  month =        aug,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912600102",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Nov 3 10:36:23 MDT 2012",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chen:2012:LOL,
  author =       "Danny Z. Chen and Haitao Wang",
  title =        "Locating an Obnoxious Line Among Planar Objects",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "5",
  pages =        "391--??",
  month =        oct,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500082",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 20 06:41:37 MST 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Das:2012:DUD,
  author =       "Gautam K. Das and Robert Fraser and Alejandro
                 L{\'o}opez-Ortiz and Bradford G. Nickerson",
  title =        "On the Discrete Unit Disk Cover Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "5",
  pages =        "407--??",
  month =        oct,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500094",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 20 06:41:37 MST 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cortes:2012:RBS,
  author =       "Carmen Cort{\'e}s and Delia Garijo and Mar{\'i}a
                 {\'A}ngeles Garrido and Clara I. Grima and Alberto
                 M{\'a}rquez and Auxiliadora Moreno-Gonz{\'a}lez and
                 Jes{\'u}s Valenzuela and Mar{\'i}a Trinidad Villar",
  title =        "Reporting Bichromatic Segment Intersections from Point
                 Sets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "5",
  pages =        "421--??",
  month =        oct,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500100",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 20 06:41:37 MST 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2012:PGT,
  author =       "Prosenjit Bose and Vida Dujmovi{\'c} and Ferran
                 Hurtado and John Iacono and Stefan Langerman and Henk
                 Meijer and Vera Sacrist{\'a}n and Maria Saumell and
                 David R. Wood",
  title =        "{Proximity Graphs}: {$E$}, $ \delta $, {$ \Delta $}, $
                 \chi $ and $ \omega $",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "5",
  pages =        "439--??",
  month =        oct,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500112",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 20 06:41:37 MST 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Huber:2012:FSS,
  author =       "Stefan Huber and Martin Held",
  title =        "A Fast Straight-Skeleton Algorithm Based on
                 Generalized Motorcycle Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "5",
  pages =        "471--??",
  month =        oct,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500124",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Feb 20 06:41:37 MST 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Binder:2012:BII,
  author =       "Thomas Binder and Thomas Martinetz",
  title =        "On the Boundedness of an Iteration Involving Points on
                 the Hypersphere",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "6",
  pages =        "499--??",
  month =        dec,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500136",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Jun 24 12:04:08 MDT 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Myers:2012:PSD,
  author =       "Yonatan Myers and Leo Joskowicz",
  title =        "Point Set Distance and Orthogonal Range Problems with
                 Dependent Geometric Uncertainties",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "6",
  pages =        "517--??",
  month =        dec,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500148",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Jun 24 12:04:08 MDT 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dehkordi:2012:EOP,
  author =       "Hooman Reisi Dehkordi and Peter Eades",
  title =        "Every Outer-$1$-Plane Graph Has a Right Angle Crossing
                 Drawing",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "6",
  pages =        "543--??",
  month =        dec,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591250015X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Jun 24 12:04:08 MDT 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Abellanas:2012:ISP,
  author =       "Manuel Abellanas and Merc{\`e} Claverol and Gregorio
                 Hern{\'a}ndez and Ferran Hurtado and Vera Sacrist{\'a}n
                 and Maria Saumell and Rodrigo I. Silveira",
  title =        "Improving Shortest Paths in the {Delaunay}
                 Triangulation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "6",
  pages =        "559--??",
  month =        dec,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500161",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Jun 24 12:04:08 MDT 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Nguyen:2012:EGR,
  author =       "Viet-Hang Nguyen",
  title =        "$1$-Extensions and Global Rigidity of Generic
                 Direction-Length Frameworks",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "6",
  pages =        "577--??",
  month =        dec,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912500173",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Jun 24 12:04:08 MDT 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2012:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 22 (2012)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "22",
  number =       "6",
  pages =        "593--??",
  month =        dec,
  year =         "2012",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195912990014",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Jun 24 12:04:08 MDT 2013",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Milenkovic:2013:PSM,
  author =       "Victor Milenkovic and Elisha Sacks and Steven Trac",
  title =        "Planar Shape Manipulation Using Approximate Geometric
                 Primitives",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "1",
  pages =        "1--??",
  month =        feb,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913500015",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:02:22 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Berg:2013:CPP,
  author =       "Mark {De Berg} and Dirk H. P. Gerrits",
  title =        "Computing Push Plans for Disk-Shaped Robots",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "1",
  pages =        "29--??",
  month =        feb,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913500027",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:02:22 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Butler:2013:CPT,
  author =       "Steve Butler and Erik Demaine and Ron Graham and
                 Tomohiro Tachi",
  title =        "Constructing Points Through Folding and Intersection",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "1",
  pages =        "49--??",
  month =        feb,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913500039",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:02:22 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Shirakawa:2013:CDT,
  author =       "Toshihiro Shirakawa and Ryuhei Uehara",
  title =        "Common Developments of Three Incongruent Orthogonal
                 Boxes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "1",
  pages =        "65--??",
  month =        feb,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913500040",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:02:22 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Asano:2013:GEF,
  author =       "Takao Asano and Shin-Ichi Nakano and Yoshio Okamoto",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "2",
  pages =        "73--??",
  month =        apr,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913020019",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:02:29 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Abel:2013:FEP,
  author =       "Zachary Abel and Erik D. Demaine and Martin L. Demaine
                 and Sarah Eisenstat and Jayson Lynch and Tao B. Schardl
                 and Isaac Shapiro-Ellowitz",
  title =        "Folding Equilateral Plane Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "2",
  pages =        "75--??",
  month =        apr,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913600017",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:02:29 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Angelini:2013:SEE,
  author =       "Patrizio Angelini and Giuseppe {Di Battista} and
                 Fabrizio Frati",
  title =        "Simultaneous Embedding of Embedded Planar Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "2",
  pages =        "93--??",
  month =        apr,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913600029",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:02:29 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dumitrescu:2013:CPC,
  author =       "Adrian Dumitrescu and Masud Hasan",
  title =        "Cutting Out Polygons with a Circular Saw",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "2",
  pages =        "127--??",
  month =        apr,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913600030",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:02:29 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Nekrich:2013:EMO,
  author =       "Yakov Nekrich",
  title =        "External Memory Orthogonal Range Reporting with Fast
                 Updates",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "2",
  pages =        "141--??",
  month =        apr,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913600042",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:02:29 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cheong:2013:SSD,
  author =       "Otfried Cheong and Changryeol Lee",
  title =        "Single-Source Dilation-Bounded Minimum Spanning
                 Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "3",
  pages =        "159--??",
  month =        jun,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913500052",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:06:09 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Grossman:2013:MCC,
  author =       "P. A. Grossman and M. Brazil and J. H. Rubinstein and
                 D. A. Thomas",
  title =        "Minimal Curvature-Constrained Paths in the Plane with
                 a Constraint on Arcs with Opposite Orientations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "3",
  pages =        "171--??",
  month =        jun,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913500064",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:06:09 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Khandhawit:2013:LBC,
  author =       "Tirasan Khandhawit and Dimitrios Pagonakis and Sira
                 Sriswasdi",
  title =        "Lower Bound for Convex Hull Area and Universal Cover
                 Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "3",
  pages =        "197--??",
  month =        jun,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913500076",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:06:09 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hurtado:2013:PDH,
  author =       "Ferran Hurtado and Giuseppe Liotta and David R. Wood",
  title =        "Proximity Drawings of High-Degree Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "3",
  pages =        "213--??",
  month =        jun,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913500088",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Mar 14 12:06:09 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Barequet:2013:EF,
  author =       "Gill Barequet",
  title =        "{Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "4--5",
  pages =        "231--??",
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913020020",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:53:07 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Afshani:2013:IPM,
  author =       "Peyman Afshani",
  title =        "Improved Pointer Machine and {I/O} Lower Bounds for
                 Simplex Range Reporting and Related Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "4--5",
  pages =        "233--??",
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913600054",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:53:07 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Abdullah:2013:ABN,
  author =       "Amirali Abdullah and John Moeller and Suresh
                 Venkatasubramanian",
  title =        "Approximate {Bregman} Near Neighbors in Sublinear
                 Time: Beyond the Triangle Inequality",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "4--5",
  pages =        "253--??",
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913600066",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:53:07 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Boissonnat:2013:SDT,
  author =       "Jean-Daniel Boissonnat and Ramsay Dyer and Arijit
                 Ghosh",
  title =        "The Stability of {Delaunay} Triangulations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "4--5",
  pages =        "303--??",
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913600078",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:53:07 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kaplan:2013:FLE,
  author =       "Haim Kaplan and Micha Sharir",
  title =        "Finding the Largest Empty Disk Containing a Query
                 Point",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "4--5",
  pages =        "335--??",
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591360008X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:53:07 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Biedl:2013:PSE,
  author =       "Therese Biedl and Martin Vatshelle",
  title =        "The Point-Set Embeddability Problem for Plane Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "4--5",
  pages =        "357--??",
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913600091",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:53:07 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Emiris:2013:OBO,
  author =       "Ioannis Z. Emiris and Vissarion Fisikopoulos and
                 Christos Konaxis and Luis Pe{\~n}aranda",
  title =        "An Oracle-Based, Output-Sensitive Algorithm for
                 Projections of Resultant Polytopes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "4--5",
  pages =        "397--??",
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913600108",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:53:07 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chao:2013:GEF,
  author =       "Kun-Mao Chao and Tsan-Sheng Hsu and Der-Tsai Lee",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "6",
  pages =        "425--??",
  month =        dec,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913020032",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:56:30 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Durocher:2013:RNS,
  author =       "Stephane Durocher and Alexandre Leblanc and Jason
                 Morrison and Matthew Skala",
  title =        "Robust Nonparametric Simplification of Polygonal
                 Chains",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "6",
  pages =        "427--??",
  month =        dec,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591360011X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:56:30 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Papadopoulou:2013:FLS,
  author =       "Evanthia Papadopoulou and Sandeep Kumar Dey",
  title =        "On the Farthest Line-Segment {Voronoi} Diagram",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "6",
  pages =        "443--??",
  month =        dec,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195913600121",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:56:30 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{De:2013:AAV,
  author =       "Minati De and Gautam K. Das and Paz Carmi and Subhas
                 C. Nandy",
  title =        "Approximation Algorithms for a Variant of Discrete
                 Piercing Set Problem for Unit Disks",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "6",
  pages =        "461--??",
  month =        dec,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591350009X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:56:30 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2013:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 23 (2013)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "23",
  number =       "6",
  pages =        "479--??",
  month =        dec,
  year =         "2013",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591399001X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Jul 25 08:56:30 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Maftuleac:2014:ADP,
  author =       "Daniela Maftuleac",
  title =        "Algorithms for Distance Problems in Planar Complexes
                 of Global Nonpositive Curvature",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "1",
  pages =        "1--??",
  month =        mar,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914500010",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Oct 29 06:39:33 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Reshetov:2014:UPF,
  author =       "Alexander Reshetov",
  title =        "A Unistable Polyhedron with $ 14 $ Faces",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "1",
  pages =        "39--??",
  month =        mar,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914500022",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Oct 29 06:39:33 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Huber:2014:TPW,
  author =       "Stefan Huber and Martin Held and Peter Meerwald and
                 Roland Kwitt",
  title =        "Topology-Preserving Watermarking of Vector Graphics",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "1",
  pages =        "61--??",
  month =        mar,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914500034",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Oct 29 06:39:33 MDT 2014",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Brazil:2014:UOS,
  author =       "Marcus Brazil and Martin Zachariasen",
  title =        "The Uniform Orientation {Steiner} Tree Problem Is
                 {NP}-Hard",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "2",
  pages =        "87--??",
  month =        jun,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914500046",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Feb 14 08:15:19 MST 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ahn:2014:CCS,
  author =       "Hee-Kap Ahn and Hyo-Sil Kim and Sang-Sub Kim and
                 Wanbin Son",
  title =        "Computing $k$ Centers over Streaming Data for Small
                 $k$",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "2",
  pages =        "107--??",
  month =        jun,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914500058",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Feb 14 08:15:19 MST 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Boissonnat:2014:DSP,
  author =       "Jean-Daniel Boissonnat and Ramsay Dyer and Arijit
                 Ghosh",
  title =        "{Delaunay} Stability Via Perturbations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "2",
  pages =        "125--??",
  month =        jun,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591450006X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Feb 14 08:15:19 MST 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Khopkar:2014:HRC,
  author =       "Abhijeet Khopkar and Sathish Govindarajan",
  title =        "Hardness Results for Computing Optimal Locally
                 {Gabriel} Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "2",
  pages =        "153--??",
  month =        jun,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914500071",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Feb 14 08:15:19 MST 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Diaz-Banez:2014:EF,
  author =       "J. M. D{\'i}az-B{\'a}{\~n}ez and R. Klein and J.
                 Urrutia",
  title =        "Editors' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "3",
  pages =        "173--??",
  month =        sep,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914020014",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:34 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fabila-Monroy:2014:NNO,
  author =       "Ruy Fabila-Monroy and Clemens Huemer and Eul{\`a}lia
                 Tramuns",
  title =        "Note on the Number of Obtuse Angles in Point Sets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "3",
  pages =        "177--??",
  month =        sep,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600012",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:34 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bereg:2014:CSP,
  author =       "S. Bereg and J. M. D{\'i}az-B{\'a}{\~n}ez and M. Fort
                 and M. A. Lopez and P. P{\'e}rez-Lantero and J.
                 Urrutia",
  title =        "Continuous Surveillance of Points by Rotating
                 Floodlights",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "3",
  pages =        "183--??",
  month =        sep,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600024",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:34 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aichholzer:2014:FCP,
  author =       "Oswin Aichholzer and Thomas Hackl and David Orden and
                 Alexander Pilz and Maria Saumell and Birgit
                 Vogtenhuber",
  title =        "Flips in Combinatorial Pointed Pseudo-Triangulations
                 with Face Degree at Most Four",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "3",
  pages =        "197--??",
  month =        sep,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600036",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:34 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kirkpatrick:2014:PTA,
  author =       "David Kirkpatrick and Boting Yang and Sandra Zilles",
  title =        "A Polynomial-Time Algorithm for Computing the
                 Resilience of Arrangements of Ray Sensors",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "3",
  pages =        "225--??",
  month =        sep,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600048",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:34 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cano:2014:SSP,
  author =       "Javier Cano and Ferran Hurtado and Jorge Urrutia",
  title =        "Stabbing Simplices of Point Sets with $k$-Flats",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "3",
  pages =        "237--??",
  month =        sep,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591460005X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:34 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bereg:2014:EDC,
  author =       "S. Bereg and R. Fabila-Monroy and D.
                 Flores-Pe{\~n}aloza and M. A. Lopez and P.
                 P{\'e}rez-Lantero",
  title =        "Embedding the Double Circle in a Square Grid of
                 Minimum Size",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "3",
  pages =        "247--??",
  month =        sep,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600061",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:34 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@String{j-INT-J-COMPUT-GEOM-APPL = "International Journal of Computational Geometry and Applications (IJCGA)"}

@Article{Ahn:2014:GEF,
  author =       "Hee-Kap Ahn and Antoine Vigneron",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "4",
  pages =        "259--??",
  month =        dec,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914020026",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:46 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mulzer:2014:ATT,
  author =       "Wolfgang Mulzer and Yannik Stein",
  title =        "Algorithms for Tolerant {Tverberg} Partitions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "4",
  pages =        "261--??",
  month =        dec,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600073",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:46 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hurtado:2014:TVM,
  author =       "Ferran Hurtado and Maarten L{\"o}ffler and In{\^e}s
                 Matos and Vera Sacrist{\'a}n and Maria Saumell and
                 Rodrigo I. Silveira and Frank Staals",
  title =        "Terrain Visibility with Multiple Viewpoints",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "4",
  pages =        "275--??",
  month =        dec,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600085",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:46 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aichholzer:2014:GPP,
  author =       "Oswin Aichholzer and Thomas Hackl and Matias Korman
                 and Alexander Pilz and Birgit Vogtenhuber",
  title =        "Geodesic-Preserving Polygon Simplification",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "4",
  pages =        "307--??",
  month =        dec,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600097",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:46 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Angelini:2014:TMD,
  author =       "Patrizio Angelini and Thomas Bl{\"a}sius and Ignaz
                 Rutter",
  title =        "Testing Mutual Duality of Planar Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "4",
  pages =        "325--??",
  month =        dec,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600103",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:46 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bohler:2014:AVD,
  author =       "Cecilia Bohler and Rolf Klein",
  title =        "Abstract {Voronoi} Diagrams with Disconnected
                 Regions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "4",
  pages =        "347--??",
  month =        dec,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600115",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:46 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Buchin:2014:DPL,
  author =       "Kevin Buchin and Dirk H. P. Gerrits",
  title =        "Dynamic Point Labeling Is Strongly {Pspace}-Complete",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "4",
  pages =        "373--??",
  month =        dec,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914600127",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:46 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2014:AIV,
  author =       "Anonymous",
  title =        "Author Index: Volume 24 (2014)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "24",
  number =       "4",
  pages =        "397--??",
  month =        dec,
  year =         "2014",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195914990015",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 26 05:48:46 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Jiang:2015:CPM,
  author =       "Minghui Jiang",
  title =        "On Covering Points with Minimum Turns",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "1",
  pages =        "1--??",
  month =        mar,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/s0218195915500016",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Jun 10 07:47:29 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Estivill-Castro:2015:IFC,
  author =       "Vladimir Estivill-Castro",
  title =        "Is It {FPT} to Cover Points with Tours on Minimum
                 Number of Bends (Errata)?",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "1",
  pages =        "11--??",
  month =        mar,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/s0218195915500028",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Jun 10 07:47:29 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  note =         "See \cite{Estivill-Castro:2011:FAM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Speckmann:2015:ANM,
  author =       "Bettina Speckmann and Kevin Verbeek",
  title =        "Algorithms for Necklace Maps",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "1",
  pages =        "15--??",
  month =        mar,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/s021819591550003x",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Jun 10 07:47:29 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Liu:2015:OSI,
  author =       "David J. T. Liu and Qiang Du",
  title =        "Optimization of Subdivision Invariant Tetrahedra",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "1",
  pages =        "37--??",
  month =        mar,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/s0218195915500041",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Jun 10 07:47:29 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wang:2015:AMT,
  author =       "Haitao Wang",
  title =        "Aggregate-{MAX} Top-$k$ Nearest Neighbor Searching in
                 the {$ L_1$} Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "1",
  pages =        "57--??",
  month =        mar,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/s0218195915500053",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Jun 10 07:47:29 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ames:2015:LSP,
  author =       "Brendan Ames and Andrew Beveridge and Rosalie Carlson
                 and Claire Djang and Volkan Isler and Stephen Ragain
                 and Maxray Savage",
  title =        "A Leapfrog Strategy for Pursuit-Evasion in a Polygonal
                 Environment",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "2",
  pages =        "??--??",
  month =        jun,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500065",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Aug 13 08:13:12 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Eppstein:2015:IGM,
  author =       "David Eppstein and Marc van Kreveld and Bettina
                 Speckmann and Frank Staals",
  title =        "Improved Grid Map Layout by Point Set Matching",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "2",
  pages =        "??--??",
  month =        jun,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500077",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Aug 13 08:13:12 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Papadopoulou:2015:HVD,
  author =       "Evanthia Papadopoulou and Jinhui Xu",
  title =        "The {$ L_\infty $} {Hausdorff} {Voronoi} Diagram
                 Revisited",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "2",
  pages =        "??--??",
  month =        jun,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500089",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Aug 13 08:13:12 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Andre:2015:FFR,
  author =       "Julien Andr{\'e} and Dominique Attali and Quentin
                 M{\'e}rigot and Boris Thibert",
  title =        "Far-Field Reflector Problem Under Design Constraints",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "2",
  pages =        "??--??",
  month =        jun,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500090",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Aug 13 08:13:12 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mustafa:2015:CCP,
  author =       "Nabil H. Mustafa and Saurabh Ray and Nabil H.
                 Mustafa",
  title =        "$k$-Centerpoints Conjectures for Pointsets in {$
                 \mathbb {R}^d$}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "3",
  pages =        "??--??",
  month =        sep,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500107",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 16 05:56:11 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cavazza:2015:EMP,
  author =       "Niccol{\`o} Cavazza and Massimo Ferri and Claudia
                 Landi",
  title =        "Estimating Multidimensional Persistent Homology
                 Through a Finite Sampling",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "3",
  pages =        "??--??",
  month =        sep,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500119",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 16 05:56:11 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Willerton:2015:SMS,
  author =       "Simon Willerton",
  title =        "Spread: A Measure of the Size of Metric Spaces",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "3",
  pages =        "??--??",
  month =        sep,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500120",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 16 05:56:11 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Carmi:2015:MDS,
  author =       "Paz Carmi and Gautam K. Das and Ramesh K. Jallu and
                 Subhas C. Nandy and Prajwal R. Prasad and Yael Stein",
  title =        "Minimum Dominating Set Problem for Unit Disks
                 Revisited",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "3",
  pages =        "??--??",
  month =        sep,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500132",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 16 05:56:11 MDT 2015",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Carlsson:2015:BMP,
  author =       "John Gunnar Carlsson and Benjamin Armbruster and
                 Saladi Rahul and Haritha Bellam",
  title =        "A Bottleneck Matching Problem with Edge-Crossing
                 Constraints",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "4",
  pages =        "245--??",
  month =        dec,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500144",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 3 06:48:40 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Mahapatra:2015:PTA,
  author =       "Priya Ranjan Sinha Mahapatra and Partha P. Goswami and
                 Sandip Das",
  title =        "Placing Two Axis-Parallel Squares to Maximize the
                 Number of Enclosed Points",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "4",
  pages =        "263--??",
  month =        dec,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500156",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 3 06:48:40 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aichholzer:2015:CPT,
  author =       "Oswin Aichholzer and Franz Aurenhammer and Thomas
                 Hackl and Clemens Huemer and Alexander Pilz and Birgit
                 Vogtenhuber",
  title =        "$3$-Colorability of Pseudo-Triangulations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "4",
  pages =        "283--??",
  month =        dec,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915500168",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 3 06:48:40 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Duque:2015:UBK,
  author =       "Frank Duque and Carlos Hidalgo-Toscano",
  title =        "An Upper Bound on the $k$-Modem Illumination Problem",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "4",
  pages =        "299--??",
  month =        dec,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591550017X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 3 06:48:40 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2015:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 25 (2015)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "25",
  number =       "4",
  pages =        "309--??",
  month =        dec,
  year =         "2015",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195915990010",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 3 06:48:40 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@String{j-INT-J-COMPUT-GEOM-APPL = "International Journal of Computational Geometry and Applications (IJCGA)"}

@Article{Roy:2016:PVG,
  author =       "Bodhayan Roy",
  title =        "Point Visibility Graph Recognition is {NP}-Hard",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "1",
  pages =        "1--??",
  month =        mar,
  year =         "2016",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 3 06:48:41 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Scheffer:2016:MFC,
  author =       "Christian Scheffer",
  title =        "More Flexible Curve Matching via the Partial
                 {Fr{\'e}chet} Similarity",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "1",
  pages =        "33--??",
  month =        mar,
  year =         "2016",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 3 06:48:41 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Schlesinger:2016:FSC,
  author =       "M. I. Schlesinger and E. V. Vodolazskiy and V. M.
                 Yakovenko",
  title =        "{Fr{\'e}chet} Similarity of Closed Polygonal Curves",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "1",
  pages =        "53--??",
  month =        mar,
  year =         "2016",
  CODEN =        "IJCAEV",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue May 3 06:48:41 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Ashok:2016:SLV,
  author =       "Pradeesha Ashok and Sathish Govindarajan and Ninad
                 Rajgopal",
  title =        "Selection Lemmas for Various Geometric Objects",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "2",
  pages =        "67--??",
  month =        jun,
  year =         "2016",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195916500047",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Sep 8 06:57:20 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dumitrescu:2016:LBD,
  author =       "Adrian Dumitrescu and Anirban Ghosh",
  title =        "Lower Bounds on the Dilation of Plane Spanners",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "2",
  pages =        "89--??",
  month =        jun,
  year =         "2016",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195916500059",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Sep 8 06:57:20 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bueno:2016:CTM,
  author =       "Lucas Moutinho Bueno and Jorge Stolfi",
  title =        "$3$-Colored Triangulation of {$2$D} Maps",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "2",
  pages =        "111--133",
  month =        jun,
  year =         "2016",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195916500060",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Sep 8 06:57:20 MDT 2016",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Knauer:2016:GEF,
  author =       "Christian Knauer and Michiel Smid",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "3--4",
  pages =        "iii--iv",
  month =        sep # "\slash " # dec,
  year =         "2016",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195916020015",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2016:PO,
  author =       "Prosenjit Bose and Pat Morin and Andr{\'e} van
                 Renssen",
  title =        "The Price of Order",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "3--4",
  pages =        "135--149",
  month =        sep # "\slash " # dec,
  year =         "2016",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195916600013",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Suri:2016:MLV,
  author =       "Subhash Suri and Kevin Verbeek",
  title =        "On the Most Likely {Voronoi} Diagram and Nearest
                 Neighbor Searching",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "3--4",
  pages =        "151--166",
  month =        sep # "\slash " # dec,
  year =         "2016",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195916600025",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aichholzer:2016:RPS,
  author =       "Oswin Aichholzer and Jean Cardinal and Vincent Kusters
                 and Stefan Langerman and Pavel Valtr",
  title =        "Reconstructing Point Set Order Types from Radial
                 Orderings",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "3--4",
  pages =        "167--184",
  month =        sep # "\slash " # dec,
  year =         "2016",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195916600037",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wang:2016:LCM,
  author =       "Haitao Wang and Jingru Zhang",
  title =        "Line-Constrained $k$-Median, $k$-Means, and $k$-Center
                 Problems in the Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "3--4",
  pages =        "185--210",
  month =        sep # "\slash " # dec,
  year =         "2016",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195916600049",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Biedl:2016:PMW,
  author =       "Therese Biedl and Stefan Huber and Peter Palfrader",
  title =        "Planar Matchings for Weighted Straight Skeletons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "3--4",
  pages =        "211--229",
  month =        sep # "\slash " # dec,
  year =         "2016",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195916600050",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2016:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 26 (2016)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "26",
  number =       "3--4",
  pages =        "231--231",
  month =        sep # "\slash " # dec,
  year =         "2016",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195916990016",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{deBerg:2017:GEF,
  author =       "Mark de Berg and Adrian Dumitrescu and Khaled
                 Elbassioni",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "1--2",
  pages =        "1--2",
  month =        mar # "\slash " # jun,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917020010",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:11 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cheng:2017:APL,
  author =       "Siu-Wing Cheng and Man-Kit Lau",
  title =        "Adaptive Point Location in Planar Convex
                 Subdivisions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "1--2",
  pages =        "3--12",
  month =        mar # "\slash " # jun,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917600019",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:11 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Cheng:2017:NWR,
  author =       "Siu-Wing Cheng and Man-Kwun Chiu and Jiongxin Jin and
                 Antoine Vigneron",
  title =        "Navigating Weighted Regions with Scattered Skinny
                 Tetrahedra",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "1--2",
  pages =        "13--32",
  month =        mar # "\slash " # jun,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917600020",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:11 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chang:2017:IAG,
  author =       "Yi-Jun Chang and Hsu-Chun Yen",
  title =        "Improved Algorithms for Grid-Unfolding Orthogonal
                 Polyhedra",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "1--2",
  pages =        "33--56",
  month =        mar # "\slash " # jun,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917600032",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:11 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aichholzer:2017:OAR,
  author =       "Oswin Aichholzer and Vincent Kusters and Wolfgang
                 Mulzer and Alexander Pilz and Manuel Wettstein",
  title =        "An Optimal Algorithm for Reconstructing Point Set
                 Order Types from Radial Orderings",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "1--2",
  pages =        "57--83",
  month =        mar # "\slash " # jun,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917600044",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:11 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bringmann:2017:IAF,
  author =       "Karl Bringmann and Marvin K{\"u}nnemann",
  title =        "Improved Approximation for {Fr{\'e}chet} Distance on
                 $c$-Packed Curves Matching Conditional Lower Bounds",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "1--2",
  pages =        "85--119",
  month =        mar # "\slash " # jun,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917600056",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:11 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Nollenburg:2017:PGD,
  author =       "Martin N{\"o}llenburg and Roman Prutkin and Ignaz
                 Rutter",
  title =        "Partitioning Graph Drawings and Triangulated Simple
                 Polygons into Greedily Routable Regions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "1--2",
  pages =        "121--158",
  month =        mar # "\slash " # jun,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917600068",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:11 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Alt:2017:MCC,
  author =       "Helmut Alt and Sergio Cabello and Panos Giannopoulos
                 and Christian Knauer",
  title =        "Minimum Cell Connection in Line Segment Arrangements",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "3",
  pages =        "159--176",
  month =        sep,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917500017",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:12 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Yon:2017:FLC,
  author =       "Juyoung Yon and Siu-Wing Cheng and Otfried Cheong and
                 Antoine Vigneron",
  title =        "Finding Largest Common Point Sets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "3",
  pages =        "177--185",
  month =        sep,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917500029",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:12 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Lee:2017:MMM,
  author =       "Victor C. S. Lee and Haitao Wang and Xiao Zhang",
  title =        "Minimizing the Maximum Moving Cost of Interval
                 Coverage",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "3",
  pages =        "187--205",
  month =        sep,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917500030",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:12 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Abu-Affash:2017:SCS,
  author =       "A. Karim Abu-Affash and Paz Carmi and Anat Parush
                 Tzur",
  title =        "Strongly Connected Spanning Subgraph for Almost
                 Symmetric Networks",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "3",
  pages =        "207--219",
  month =        sep,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917500042",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:12 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bohler:2017:AVD,
  author =       "Cecilia Bohler and Rolf Klein and Chih-Hung Liu",
  title =        "Abstract {Voronoi} Diagrams from Closed Bisecting
                 Curves",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "3",
  pages =        "221--240",
  month =        sep,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917500054",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Jan 30 16:47:12 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2017:COR,
  author =       "Prosenjit Bose and Jean-Lou {De Carufel} and Stephane
                 Durocher and Perouz Taslakian",
  title =        "Competitive Online Routing on {Delaunay}
                 Triangulations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "4",
  pages =        "241--??",
  month =        dec,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917500066",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Feb 20 07:07:09 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{daFonseca:2017:SCO,
  author =       "Guilherme D. da Fonseca and Vin{\'\i}cius Gusm{\~a}o
                 Pereira de S{\'a} and Celina Miraglia Herrera de
                 Figueiredo",
  title =        "Shifting Coresets: Obtaining Linear-Time
                 Approximations for Unit Disk Graphs and Other Geometric
                 Intersection Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "4",
  pages =        "255--??",
  month =        dec,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917500078",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Feb 20 07:07:09 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Froese:2017:FPG,
  author =       "Vincent Froese and Iyad Kanj and Andr{\'e} Nichterlein
                 and Rolf Niedermeier",
  title =        "Finding Points in General Position",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "4",
  pages =        "277--??",
  month =        dec,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591750008X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Feb 20 07:07:09 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bueno:2017:CTM,
  author =       "Lucas Moutinho Bueno and Jorge Stolfi",
  title =        "$4$-Colored Triangulation of $3$-Maps",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "4",
  pages =        "297--??",
  month =        dec,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917500091",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Feb 20 07:07:09 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2017:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 27 (2017)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "27",
  number =       "4",
  pages =        "327--??",
  month =        dec,
  year =         "2017",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195917990011",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Feb 20 07:07:09 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hummel:2018:LIM,
  author =       "Michelle Hatch Hummel and Bihua Yu and Carlos
                 Simmerling and Evangelos A. Coutsias",
  title =        "{Laguerre}-Intersection Method for Implicit
                 Solvation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "1",
  pages =        "1--??",
  month =        mar,
  year =         "2018",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195918500012",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Apr 3 17:02:59 MDT 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Buot:2018:WES,
  author =       "Jude Buot and Mikio Kano",
  title =        "Weight-Equitable Subdivision of Red and Blue Points in
                 the Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "1",
  pages =        "39--??",
  month =        mar,
  year =         "2018",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195918500024",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Apr 3 17:02:59 MDT 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Beketayev:2018:MEA,
  author =       "Kenes Beketayev and Damir Yeliussizov and Dmitriy
                 Morozov and Gunther H. Weber and Bernd Hamann",
  title =        "Measuring the Error in Approximating the Sub-Level Set
                 Topology of Sampled Scalar Data",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "1",
  pages =        "57--??",
  month =        mar,
  year =         "2018",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195918500036",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Tue Apr 3 17:02:59 MDT 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hong:2018:GEF,
  author =       "Seok-Hee Hong",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "2",
  pages =        "??--??",
  month =        jun,
  year =         "2018",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195918020016",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Yu:2018:CPP,
  author =       "Hung-I Yu and Tien-Ching Lin and D. T. Lee",
  title =        "The $ (1 | 1)$-Centroid Problem in the Plane with
                 Distance Constraints",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "2",
  pages =        "??--??",
  month =        jun,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918600014",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "In 1982, Drezner proposed the $ (1 | 1)$-centroid
                 problem on the plane, in which two players, called the
                 leader and the follower, open facilities to provide
                 service to customers in a competitive manner. The
                 leader opens the first facility, and the follower opens
                 the second. Customers will each patronize the facility
                 closer to them (with ties broken in favor of the first
                 one), thereby deciding the market share of the two
                 facilities. The goal is to find the best position for
                 the leader's facility so that its market share is
                 maximized. The best algorithm of this problem is an $
                 O(n^2 \log n)$-time parametric search approach, which
                 searches over the space of market share values. In the
                 same paper, Drezner also proposed a generalized version
                 of $ (1 | 1) $-centroid problem by introducing a
                 minimal distance constraint $R$, such that the
                 follower's facility is not allowed to be located within
                 a distance $R$ from the leader's. He proposed an $
                 O(n^5 \log n)$-time algorithm for this generalized
                 version by identifying $ O(n^4)$ points as the
                 candidates of the optimal solution and checking the
                 market share for each of them. In this paper, we
                 develop a new parametric search approach searching over
                 the $ O(n^4)$ candidate points, and present an $ O(n^2
                 \log n)$-time algorithm for this generalized version,
                 thereby closing the $ O(n^3)$ gap between the two
                 bounds.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Alt:2018:ASC,
  author =       "Helmut Alt and Nadja Scharf",
  title =        "Approximating Smallest Containers for Packing
                 Three-Dimensional Convex Objects",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "2",
  pages =        "??--??",
  month =        jun,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918600026",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "We investigate the problem of computing a
                 minimal-volume container for the non-overlapping
                 packing of a given set of three-dimensional convex
                 objects. Already the simplest versions of the problem
                 are $ \cal N P$-hard so that we cannot expect to find
                 polynomial time algorithms to determine the exact
                 solution. We give constant ratio approximation
                 algorithms for packing axis-parallel (rectangular)
                 cuboids under translation into an axis-parallel
                 (rectangular) cuboid as container, for packing cuboids
                 under rigid motions into an axis-parallel cuboid or
                 into an arbitrary convex container, and for packing
                 convex polyhedra under rigid motions into an
                 axis-parallel cuboid or arbitrary convex container.
                 This work gives the first approximability results for
                 the computation of minimum volume containers for the
                 objects described.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fekete:2018:UGP,
  author =       "S{\'a}ndor P. Fekete and Qian Li and Joseph S. B.
                 Mitchell and Christian Scheffer",
  title =        "Universal Guard Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "2",
  pages =        "??--??",
  month =        jun,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918600038",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "Given a set S of n points in the plane, how many
                 universal guards are sometimes necessary and always
                 sufficient to guard any simple polygon with vertex set
                 S ? We call this problem a Universal Guard Problem and
                 provide a spectrum of results. We give upper and lower
                 bounds on the number of universal guards that are
                 always sufficient to guard all polygons having a given
                 set of n vertices, or to guard all polygons in a given
                 set of k polygons on an n -point vertex set. Our upper
                 bound proofs include algorithms to construct universal
                 guard sets of the respective cardinalities.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Akitaya:2018:RWS,
  author =       "Hugo A. Akitaya and Csaba D. T{\'o}th",
  title =        "Reconstruction of Weakly Simple Polygons from Their
                 Edges",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "2",
  pages =        "??--??",
  month =        jun,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S021819591860004X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "We address the problem of reconstructing a polygon
                 from the multiset of its edges. Given $n$ line segments
                 in the plane, find a polygon with $n$ vertices whose
                 edges are these segments, or report that none exists.
                 It is easy to solve the problem in $ O(n \log n)$ time
                 if we seek an arbitrary polygon or a simple polygon. We
                 show that the problem is NP-complete for weakly simple
                 polygons, that is, a polygon whose vertices can be
                 perturbed by at most $ \epsilon $, for any $ \epsilon >
                 0$, to obtain a simple polygon. We give $ O(n)$-time
                 algorithms for reconstructing weakly simple polygons:
                 when all segments are collinear or the segment
                 endpoints are in general position. These results extend
                 to the variant in which the segments are directed. We
                 study related problems for the case that the union of
                 the $n$ input segments is connected. (i) If each
                 segment can be subdivided into several segments, find
                 the minimum number of subdivision points to form a
                 weakly simple polygon. (ii) If new line segments can be
                 added, find the minimum total length of new segments
                 that creates a weakly simple polygon. We give
                 worst-case upper and lower bounds for both problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{vanKreveld:2018:RDG,
  author =       "Marc van Kreveld and Maarten L{\"o}ffler and Frank
                 Staals and Lionov Wiratma",
  title =        "A Refined Definition for Groups of Moving Entities and
                 Its Computation",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "2",
  pages =        "??--??",
  month =        jun,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918600051",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:10 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "One of the important tasks in the analysis of
                 spatio-temporal data collected from moving entities is
                 to find a group: a set of entities that travel together
                 for a sufficiently long period of time. Buchin et al.
                 introduce a formal definition of groups, analyze its
                 mathematical structure, and present efficient
                 algorithms for computing all maximal groups in a given
                 set of trajectories. In this paper, we refine their
                 definition and argue that our proposed definition
                 corresponds better to human intuition in certain cases,
                 particularly in dense environments. We present
                 algorithms to compute all maximal groups from a set of
                 moving entities according to the new definition. For a
                 set of $n$ moving entities in $ \mathbb {R}^1$,
                 specified by linear interpolation in a sequence of \tau
                 time stamps, we show that all maximal groups can be
                 computed in $ O(\tau^2 n^4)$ time. A similar approach
                 applies if the time stamps of entities are not the
                 same, at the cost of a small extra factor of $ \alpha
                 (n)$ in the running time, where $ \alpha $ denotes the
                 inverse Ackermann function. In higher dimensions, we
                 can compute all maximal groups in $ O(\tau^2 n^5 \log
                 n)$ time (for any constant number of dimensions),
                 regardless of whether the time stamps of entities are
                 the same or not. We also show that one \tau factor can
                 be traded for a much higher dependence on $n$ by giving
                 a $ O(\tau n^4 2^n)$ algorithm for the same problem.
                 Consequently, we give a linear-time algorithm when the
                 number of entities is constant and the input size
                 relates to the number of time stamps of each entity.
                 Finally, we provide a construction to show that it
                 might be difficult to develop an algorithm with
                 polynomial dependence on $n$ and linear dependence on $
                 \tau $.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aichholzer:2018:FPP,
  author =       "Oswin Aichholzer and Michael Biro and Erik D. Demaine
                 and Martin L. Demaine and David Eppstein and S{\'a}ndor
                 P. Fekete and Adam Hesterberg and Irina Kostitsyna and
                 Christiane Schmidt",
  title =        "Folding Polyominoes into (Poly)Cubes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "3",
  pages =        "??--??",
  month =        sep,
  year =         "2018",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195918500048",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:12 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "We study the problem of folding a polyomino $P$ into a
                 polycube $Q$, allowing faces of $Q$ to be covered
                 multiple times. First, we define a variety of folding
                 models according to whether the folds (a) must be along
                 grid lines of $P$ or can divide squares in half
                 (diagonally and/or orthogonally), (b) must be mountain
                 or can be both mountain and valley, (c) can remain flat
                 (forming an angle of 180^{\circ} ), and (d) must lie on
                 just the polycube surface or can have interior faces as
                 well. Second, we give all the inclusion relations among
                 all models that fold on the grid lines of $P$. Third,
                 we characterize all polyominoes that can fold into a
                 unit cube, in some models. Fourth, we give a
                 linear-time dynamic programming algorithm to fold a
                 tree-shaped polyomino into a constant-size polycube, in
                 some models. Finally, we consider the triangular
                 version of the problem, characterizing which
                 polyiamonds fold into a regular tetrahedron.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{dAmore:2018:LAD,
  author =       "Fabrizio d'Amore and Paolo G. Franciosa",
  title =        "A Low Arithmetic-Degree Algorithm for Computing
                 Proximity Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "3",
  pages =        "??--??",
  month =        sep,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S021819591850005X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:12 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "In this paper, we study the problem of designing
                 robust algorithms for computing the minimum spanning
                 tree, the nearest neighbor graph, and the relative
                 neighborhood graph of a set of points in the plane,
                 under the Euclidean metric. We use the term ``robust''
                 to denote an algorithm that can properly handle
                 degenerate configurations of the input (such as
                 co-circularities and collinearities) and that is not
                 affected by errors in the flow of control due to
                 round-off approximations. Existing asymptotically
                 optimal algorithms that compute such graphs are either
                 suboptimal in terms of the arithmetic precision
                 required for the implementation, or cannot handle
                 degeneracies, or are based on complex data structures.
                 We present a unified approach to the robust computation
                 of the above graphs. The approach is a variant of the
                 general region approach for the computation of
                 proximity graphs based on Yao graphs, first introduced
                 in Ref. 43 (A. C.-C. Yao, On constructing minimum
                 spanning trees in k -dimensional spaces and related
                 problems, SIAM J. Comput. 11(4) (1982) 721--736). We
                 show that a sparse supergraph of these geometric graphs
                 can be computed in asymptotically optimal time and
                 space, and requiring only double precision arithmetic,
                 which is proved to be optimal. The arithmetic
                 complexity of the approach is measured by using the
                 notion of degree, introduced in Ref. 31 (G. Liotta, F.
                 P. Preparata and R. Tamassia, Robust proximity queries:
                 An illustration of degree-driven algorithm design, SIAM
                 J. Comput. 28(3) (1998) 864--889) and Ref. 3 (J. D.
                 Boissonnat and F. P. Preparata, Robust plane sweep for
                 intersecting segments, SIAM J. Comput. 29(5) (2000)
                 1401--1421). As a side effect of our results, we solve
                 a question left open by Katajainen 27 (J. Katajainen,
                 The region approach for computing relative neighborhood
                 graphs in the Lp metric, Computing 40 (1987) 147--161)
                 about the existence of a subquadratic algorithm, based
                 on the region approach, that computes the relative
                 neighborhood graph of a set of points S in the plane
                 under the L2 metric.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Devillers:2018:WPP,
  author =       "Olivier Devillers and Louis Noizet",
  title =        "Walking in a Planar {Poisson--Delaunay} Triangulation:
                 Shortcuts in the {Voronoi} Path",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "3",
  pages =        "??--??",
  month =        sep,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918500061",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:12 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "Let $ X_n $ be a planar Poisson point process of
                 intensity $n$. We give a new proof that the expected
                 length of the Voronoi path between $ (0, 0)$ and $ (1,
                 0)$ in the Delaunay triangulation associated with $
                 X_n$ is $ 4 / \pi \approx 1.27$ when $n$ goes to
                 infinity; and we also prove that the variance of this
                 length is $ \Theta (1 / \sqrt {n})$. We investigate the
                 length of possible shortcuts in this path, and define a
                 shortened Voronoi path whose expected length can be
                 expressed as an integral that is numerically evaluated
                 to $ \approx 1.16$. The shortened Voronoi path has the
                 property to be locally defined; and is shorter than the
                 previously known locally defined paths in Delaunay
                 triangulation such as the upper path whose expected
                 length is $ 35 / 3 \pi^2 \approx 1.18$.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wang:2018:CRC,
  author =       "Haitao Wang and Jingru Zhang",
  title =        "Computing the Rectilinear Center of Uncertain Points
                 in the Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "3",
  pages =        "??--??",
  month =        sep,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918500073",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:12 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "In this paper, we consider the rectilinear one-center
                 problem on uncertain points in the plane. In this
                 problem, we are given a set $ \cal P $ of $n$
                 (weighted) uncertain points in the plane and each
                 uncertain point has m possible locations each
                 associated with a probability for the point appearing
                 at that location. The goal is to find a point q{\^a} in
                 the plane which minimizes the maximum expected
                 rectilinear distance from $ q^\ast $ to all uncertain
                 points of $ \cal P$, and $ q^\ast $ is called a
                 rectilinear center. We present an algorithm that solves
                 the problem in $ O(m n)$ time. Since the input size of
                 the problem is $ \Theta (m n)$, our algorithm is
                 optimal.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fekete:2018:CFC,
  author =       "S{\'a}ndor P. Fekete and Phillip Keldenich",
  title =        "Conflict-Free Coloring of Intersection Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "3",
  pages =        "??--??",
  month =        sep,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918500085",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Nov 16 07:12:12 MST 2018",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  abstract =     "A conflict-free $k$-coloring of a graph $ G = (V, E)$
                 assigns one of $k$ different colors to some of the
                 vertices such that, for every vertex $v$, there is a
                 color that is assigned to exactly one vertex among $v$
                 and $v$ 's neighbors. Such colorings have applications
                 in wireless networking, robotics, and geometry, and are
                 well studied in graph theory. Here we study the
                 conflict-free coloring of geometric intersection
                 graphs. We demonstrate that the intersection graph of n
                 geometric objects without fatness properties and size
                 restrictions may have conflict-free chromatic number in
                 $ \Omega (\log n / \log \log n)$ and in $ \Omega (\log
                 n)$ for disks or squares of different sizes; it is
                 known for general graphs that the worst case is in $
                 \Theta (\log_2 n)$. For unit-disk intersection graphs,
                 we prove that it is NP-complete to decide the existence
                 of a conflict-free coloring with one color; we also
                 show that six colors always suffice, using an algorithm
                 that colors unit disk graphs of restricted height with
                 two colors. We conjecture that four colors are
                 sufficient, which we prove for unit squares instead of
                 unit disks. For interval graphs, we establish a tight
                 worst-case bound of two.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Eder:2018:MMV,
  author =       "G{\"u}nther Eder and Martin Held and Peter Palfrader",
  title =        "Min-\slash Max-Volume Roofs Induced by Bisector Graphs
                 of Polygonal Footprints of Buildings",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "4",
  pages =        "309--340",
  month =        dec,
  year =         "2018",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195918500097",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Apr 12 07:19:10 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195918500097",
  abstract =     "Piecewise-linear terrains (``roofs'') over simple
                 polygons were first studied by Aichholzer et al. (J.
                 UCS 1995) in their work on straight skeletons of
                 polygons. We show how to construct a roof over the
                 polygonal footprint of a building that has minimum or
                 maximum volume among all roofs that drain water. Our
                 algorithm for computing such a roof extends the
                 standard plane-sweep approach known from the theory of
                 straight skeletons by additional events. For both types
                 of roofs our algorithm runs in $ {\cal O}(n^3 \log n) $
                 time for a simple polygon with $n$ vertices.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Aschner:2018:UCR,
  author =       "Rom Aschner and Paz Carmi and Yael Stein",
  title =        "Unique Coverage with Rectangular Regions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "4",
  pages =        "341--363",
  month =        dec,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918500103",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Apr 12 07:19:10 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195918500103",
  abstract =     "We study unique coverage problems with rectangle and
                 half-strip regions, motivated by wireless networks in
                 the context of coverage using directional antennae
                 without interference. Given a set $C$ of points
                 (clients) and a set $A$ of directional antennae in the
                 plane, the goal is to assign a direction to each
                 directional antenna in $A$, such that the number of
                 clients in $C$ that are uniquely covered by the
                 directional antennae is maximized. A client is covered
                 uniquely if it is covered by exactly one antenna. We
                 consider two types of rectangular regions representing
                 half-strip directional antennae: unbounded half-strips
                 and half-strips bounded by a range $r$ (i.e., 3-sided
                 rectangular regions and rectangular regions). The
                 directional antennae can be directed up or down. We
                 present two polynomial time algorithms: an optimal
                 solution for the problem with the 3-sided rectangular
                 regions, and a constant factor approximation for the
                 rectangular regions.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Chakraborty:2018:HTT,
  author =       "Sourav Chakraborty and Rameshwar Pratap and Sasanka
                 Roy and Shubhangi Saraf",
  title =        "{Helly}-Type Theorems in Property Testing",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "4",
  pages =        "365--379",
  month =        dec,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918500115",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Apr 12 07:19:10 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195918500115",
  abstract =     "Helly's theorem is a fundamental result in discrete
                 geometry, describing the ways in which convex sets
                 intersect with each other. If S is a set of n points in
                 {$ \mathbb {R} $ d}, we say that S is (k,G)-clusterable
                 if it can be partitioned into k clusters (subsets) such
                 that each cluster can be contained in a translated copy
                 of a geometric object G. In this paper, as an
                 application of Helly's theorem, by taking a constant
                 size sample from S, we present a testing algorithm for
                 (k,G)-clustering, i.e., to distinguish between the
                 following two cases: when S is (k,G)-clusterable, and
                 when it is $ \epsilon $ far from being
                 (k,G)-clusterable. A set S is $ \epsilon $-far $ (0 <
                 \epsilon \leq 1)$ from being (k,G)-clusterable if at
                 least $ \epsilon n$ points need to be removed from S in
                 order to make it (k,G)-clusterable. We solve this
                 problem when $ k = 1$, and G is a symmetric convex
                 object. For $ k > 1$, we solve a weaker version of this
                 problem. Finally, as an application of our testing
                 result, in the case of clustering with outliers, we
                 show that with high probability one can find the
                 approximate clusters by querying only a constant size
                 sample.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Durocher:2018:CDM,
  author =       "Stephane Durocher and Robert Fraser and Alexandre
                 Leblanc and Jason Morrison and Matthew Skala",
  title =        "On Combinatorial Depth Measures",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "4",
  pages =        "381--398",
  month =        dec,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918500127",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Apr 12 07:19:10 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195918500127",
  abstract =     "Given a set $ P = \{ p_1, \ldots {}, p_n \} $ of
                 points and a point $q$ in the plane, we define a
                 function $ \psi (q)$ that provides a combinatorial
                 characterization of the multiset of values $ \{ \| P
                 \cap H_i \| \} $, where for each $ i \in \{ 1, \ldots
                 {}, n \} $, $ H_i$ is the open half-plane determined by
                 $q$ and $ p_i$. We introduce two new natural measures
                 of depth, perihedral depth and eutomic depth, and we
                 show how to express these and the well-known simplicial
                 and Tukey depths concisely in terms of $ \psi (q)$. The
                 perihedral and eutomic depths of $q$ with respect to
                 $P$ correspond respectively to the number of subsets of
                 $P$ whose convex hull contains $q$, and the number of
                 combinatorially distinct bisections of $P$ determined
                 by a line through $q$. We present algorithms to compute
                 the depth of an arbitrary query point in $ O(n \log n)$
                 time and medians (deepest points) with respect to these
                 depth measures in $ O(n^4)$ and $ O(n^{8 / 3})$ time
                 respectively. For comparison, these results match or
                 slightly improve on the corresponding best-known
                 running times for simplicial depth, whose definition
                 involves similar combinatorial complexity.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2018:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 28 (2018)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "28",
  number =       "4",
  pages =        "399--400",
  month =        dec,
  year =         "2018",
  DOI =          "https://doi.org/10.1142/S0218195918990017",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Apr 12 07:19:10 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195918990017",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tokuyama:2019:GEF,
  author =       "Takeshi Tokuyama",
  title =        "{Guest Editor}'s Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "1",
  pages =        "1--1",
  month =        mar,
  year =         "2019",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195919020011",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 21 06:19:29 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919020011",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Amano:2019:NPT,
  author =       "Kazuyuki Amano and Yoshinobu Haruyama",
  title =        "On the Number of p4-Tilings by an $n$-Omino",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "1",
  pages =        "3--19",
  month =        mar,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919400016",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 21 06:19:29 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919400016",
  abstract =     "A plane tiling by the copies of a polyomino is called
                 isohedral if every pair of copies in the tiling has a
                 symmetry of the tiling that maps one copy to the other.
                 We show that, for every $n$-omino (i.e., polyomino
                 consisting of $n$ cells), the number of non-equivalent
                 isohedral tilings generated by 90 degree rotations, so
                 called p4-tilings or quarter-turn tilings, is bounded
                 by a constant (independent of $n$). The proof relies on
                 the analysis of the factorization of the boundary word
                 of a polyomino. We also show an example of a polyomino
                 that has three non-equivalent p4-tilings.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{deBerg:2019:FDH,
  author =       "Mark de Berg and Ade Gunawan and Marcel Roeloffzen",
  title =        "Faster {DBSCAN} and {HDBSCAN} in Low-Dimensional
                 {Euclidean} Spaces",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "1",
  pages =        "21--47",
  month =        mar,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919400028",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 21 06:19:29 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919400028",
  abstract =     "We present a new algorithm for the widely used
                 density-based clustering method dbscan. For a set of
                 $n$ points in $ \mathbb {R}^2 $ our algorithm computes
                 the dbscan-clustering in $ O(n \log n) $ time,
                 irrespective of the scale parameter $ \epsilon $ (and
                 assuming the second parameter MinPts is set to a fixed
                 constant, as is the case in practice). Experiments show
                 that the new algorithm is not only fast in theory, but
                 that a slightly simplified version is competitive in
                 practice and much less sensitive to the choice of $
                 \epsilon $ than the original dbscan algorithm. We also
                 present an $ O(n \log n)$ randomized algorithm for
                 hdbscan in the plane --- hdbscan is a hierarchical
                 version of dbscan introduced recently --- and we show
                 how to compute an approximate version of hdbscan in
                 near-linear time in any fixed dimension.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{deBerg:2019:FDK,
  author =       "Mark de Berg and Tim Leijsen and Aleksandar Markovic
                 and Andr{\'e} van Renssen and Marcel Roeloffzen and
                 Gerhard Woeginger",
  title =        "Fully-Dynamic and Kinetic Conflict-Free Coloring of
                 Intervals with Respect to Points",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "1",
  pages =        "49--72",
  month =        mar,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S021819591940003X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 21 06:19:29 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S021819591940003X",
  abstract =     "We introduce the fully-dynamic conflict-free coloring
                 problem for a set $S$ of intervals in {$ \mathbb {R}
                 $1} with respect to points, where the goal is to
                 maintain a conflict-free coloring for $S$ under
                 insertions and deletions. A coloring is conflict-free
                 if for each point $p$ contained in some interval, $p$
                 is contained in an interval whose color is not shared
                 with any other interval containing $p$. We investigate
                 trade-offs between the number of colors used and the
                 number of intervals that are recolored upon insertion
                 or deletion of an interval. Our results include: a
                 lower bound on the number of recolorings as a function
                 of the number of colors, which implies that with $
                 O(1)$ recolorings per update the worst-case number of
                 colors is $ \Omega (\log n / \log \log n)$, and that
                 any strategy using $ O(1 / \epsilon)$ colors needs $
                 \Omega (\epsilon n \epsilon)$ recolorings; a coloring
                 strategy that uses $ O(\log n)$ colors at the cost of $
                 O(\log n)$ recolorings, and another strategy that uses
                 $ O(1 / \epsilon)$ colors at the cost of $ O(n \epsilon
                 / \epsilon)$ recolorings; stronger upper and lower
                 bounds for special cases. We also consider the kinetic
                 setting where the intervals move continuously (but
                 there are no insertions or deletions); here we show how
                 to maintain a coloring with only four colors at the
                 cost of three recolorings per event and show this is
                 tight.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bint:2019:PER,
  author =       "Gregory Bint and Anil Maheshwari and Michiel Smid and
                 Subhas C. Nandy",
  title =        "Partial Enclosure Range Searching",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "1",
  pages =        "73--93",
  month =        mar,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919500018",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed Aug 21 06:19:29 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500018",
  abstract =     "A new type of range searching problem, called the
                 partial enclosure range searching problem, is
                 introduced in this paper. Given a set of geometric
                 objects $S$ and a query region $Q$, our goal is to
                 identify those objects in $S$ which intersect the query
                 region $Q$ by at least a fixed proportion of their
                 original size. Two variations of this problem are
                 studied. In the first variation, the objects in $S$ are
                 axis-parallel line segments and the goal is to count
                 the total number of members of $S$ so that their
                 intersection with $Q$ is at least a given proportion of
                 their size. Here, $Q$ can be an axis-parallel rectangle
                 or a parallelogram of arbitrary orientation. In the
                 second variation, $S$ is a polygon and $Q$ is an
                 axis-parallel rectangle. The problem is to report the
                 area of the intersection between the polygon $S$ and a
                 query rectangle $Q$.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2019:SPY,
  author =       "Prosenjit Bose and Andr{\'e} van Renssen",
  title =        "Spanning Properties of {Yao} and $ \theta $-Graphs in
                 the Presence of Constraints",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "02",
  pages =        "95--120",
  month =        jun,
  year =         "2019",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S021819591950002X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Sep 21 06:32:11 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S021819591950002X",
  abstract =     "We present improved upper bounds on the spanning ratio
                 of constrained $ \theta $-graphs with at least 6 cones
                 and constrained Yao-graphs with 5 or at least 7 cones.
                 Given a set of points in the plane, a Yao-graph
                 partitions the plane around each vertex into m disjoint
                 cones, each having aperture $ \theta = 2 / m $, and
                 adds an edge to the closest vertex in each cone.
                 Constrained Yao-graphs have the additional property
                 that no edge properly intersects any of the given line
                 segment constraints. Constrained $ \theta $-graphs are
                 similar to constrained Yao-graphs, but use a different
                 method to determine the closest vertex. We present
                 tight bounds on the spanning ratio of a large family of
                 constrained $ \theta $-graphs. We show that constrained
                 $ \theta $-graphs with $ 4 k + 2 (k \geq 1 {\rm and
                 integer})$ cones have a tight spanning ratio of $ 1 + 2
                 \sin (\theta / 2) $, where $ \theta $ is $ 2 / (4 k +
                 2) $. We also present improved upper bounds on the
                 spanning ratio of the other families of constrained $
                 \theta $-graphs. These bounds match the current upper
                 bounds in the unconstrained setting. We also show that
                 constrained Yao-graphs with an even number of cones $
                 (m \geq 8)$ have spanning ratio at most $ 1 / (1 - 2
                 \sin (\theta / 2))$ and constrained Yao-graphs with an
                 odd number of cones $ (m \geq 5)$ have spanning ratio
                 at most $ 1 / (1 - 2 \sin (3 \theta / 8))$. As is the
                 case with constrained $ \theta $-graphs, these bounds
                 match the current upper bounds in the unconstrained
                 setting, which implies that like in the unconstrained
                 setting using more cones can make the spanning ratio
                 worse.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Andersen:2019:AED,
  author =       "Patrick J. Andersen and Charl J. Ras",
  title =        "Algorithms for {Euclidean} Degree Bounded Spanning
                 Tree Problems",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "02",
  pages =        "121--160",
  month =        jun,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919500031",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Sep 21 06:32:11 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500031",
  abstract =     "Given a set of points in the Euclidean plane, the
                 Euclidean $ \delta $-minimum spanning tree ($ \delta
                 $-MST) problem is the problem of finding a spanning
                 tree with maximum degree no more than for the set of
                 points such the sum of the total length of its edges is
                 minimum. Similarly, the Euclidean $ \delta $-minimum
                 bottleneck spanning tree ($ \delta $ -MBST) problem, is
                 the problem of finding a degree-bounded spanning tree
                 for a set of points in the plane such that the length
                 of the longest edge is minimum. When $ \delta \leq 4$,
                 these two problems may yield disjoint sets of optimal
                 solutions for the same set of points. In this paper, we
                 perform computational experiments to compare the
                 accuracies of a variety of heuristic and approximation
                 algorithms for both these problems. We develop
                 heuristics for these problems and compare them with
                 existing algorithms. We also describe a new type of
                 edge swap algorithm for these problems that outperforms
                 all the algorithms we tested.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gudmundsson:2019:FFD,
  author =       "Joachim Gudmundsson and Majid Mirzanezhad and Ali
                 Mohades and Carola Wenk",
  title =        "Fast {Fr{\'e}chet} Distance Between Curves with Long
                 Edges",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "02",
  pages =        "161--187",
  month =        jun,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919500043",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Sat Sep 21 06:32:11 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500043",
  abstract =     "Computing the Fr{\'e}chet distance between two
                 polygonal curves takes roughly quadratic time. In this
                 paper, we show that for a special class of curves the
                 Fr{\'e}chet distance computations become easier. Let
                 $P$ and $Q$ be two polygonal curves in $ \mathbb {R}^d$
                 with $n$ and $m$ vertices, respectively. We prove four
                 results for the case when all edges of both curves are
                 long compared to the Fr{\'e}chet distance between them:
                 (1) a linear-time algorithm for deciding the
                 Fr{\'e}chet distance between two curves, (2) an
                 algorithm that computes the Fr{\'e}chet distance in $
                 O((n + m) \log (n + m))$ time, (3) a linear-time $
                 \sqrt {d}$-approximation algorithm, and (4) a data
                 structure that supports $ O(m \log^2 n)$-time decision
                 queries, where $m$ is the number of vertices of the
                 query curve and $n$ the number of vertices of the
                 preprocessed curve.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wang:2019:TKW,
  author =       "Haitao Wang and Wuzhou Zhang",
  title =        "On Top-$k$ Weighted Sum Aggregate Nearest and Farthest
                 Neighbors in the {$ L_1 $} Plane",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "03",
  pages =        "189--218",
  month =        sep,
  year =         "2019",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195919500055",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 25 06:34:13 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500055",
  abstract =     "In this paper, we study top-$k$ aggregate (or group)
                 nearest neighbor queries using the weighted Sum
                 operator under the $ L_1$ metric in the plane. Given a
                 set P of n points, for any query consisting of a set Q
                 of m weighted points and an integer $k$, $ 1 \leq k
                 \leq n$, the top-$k$ aggregate nearest neighbor query
                 asks for the $k$ points of $P$ whose aggregate
                 distances to $Q$ are the smallest, where the aggregate
                 distance of each point $p$ of $P$ to $Q$ is the sum of
                 the weighted distances from $p$ to all points of $Q$.
                 We build an $ O(n \log n \log \log n)$-size data
                 structure in $ O(n \log n \log \log n)$ time, such that
                 each top-$k$ query can be answered in $ O(m \log m + (k
                 + m) \log_2 n)$ time. We also obtain other results with
                 trade-off between preprocessing and query. Even for the
                 special case where $ k = 1$, our results are better
                 than the previously best work, which requires $ O(n
                 \log_2 n)$ preprocessing time, $ O(n \log_2 n)$ space,
                 and $ O(m2 \log_2 n)$ query time. In addition, for the
                 one-dimensional version of this problem, our approach
                 can build an $ O(n)$-size data structure in $ O(n \log
                 n)$ time that can support $ O(\{ \min k, \log m \}
                 \cdot m + k + \log n)$ time queries. Further, we extend
                 our techniques to answer the top-$k$ aggregate farthest
                 neighbor queries, with the same bounds.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Milenkovic:2019:FDD,
  author =       "Victor Milenkovic and Elisha Sacks and Nabeel Butt",
  title =        "Fast Detection of Degenerate Predicates in Free Space
                 Construction",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "03",
  pages =        "219--237",
  month =        sep,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919500067",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 25 06:34:13 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500067",
  abstract =     "An implementation of a computational geometry
                 algorithm is robust if the combinatorial output is
                 correct for every input. Robustness is achieved by
                 ensuring that the predicates in the algorithm are
                 evaluated correctly. A predicate is the sign of an
                 algebraic expression whose variables are input
                 parameters. The hardest case is detecting degenerate
                 predicates where the value of the expression equals
                 zero. We encounter this case in constructing the free
                 space of a polyhedron that rotates around a fixed axis
                 and translates freely relative to a stationary
                 polyhedron. Each predicate involved in the construction
                 is expressible as the sign of a univariate polynomial f
                 evaluated at a zero t of a univariate polynomial g,
                 where the coefficients of f and g are polynomials in
                 the coordinates of the polyhedron vertices. A predicate
                 is degenerate when t is a zero of a common factor of f
                 and g. We present an efficient degeneracy detection
                 algorithm based on a one-time factoring of all the
                 univariate polynomials over the ring of multivariate
                 polynomials in the vertex coordinates. Our algorithm is
                 3500 times faster than the standard algorithm based on
                 greatest common divisor computation. It reduces the
                 share of degeneracy detection in our free space
                 computations from 90\% to 0.5\% of the running time.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Eder:2019:WVD,
  author =       "G{\"u}nther Eder and Martin Held",
  title =        "Weighted {Voronoi} Diagrams in the Maximum Norm",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "03",
  pages =        "239--250",
  month =        sep,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919500079",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 25 06:34:13 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500079",
  abstract =     "We consider multiplicatively weighted points,
                 axis-aligned rectangular boxes and axis-aligned
                 straight-line segments in the plane as input sites and
                 study Voronoi diagrams of these sites in the maximum
                 norm. For n weighted input sites we establish a tight $
                 \Theta (n^2) $ worst-case bound on the combinatorial
                 complexity of their Voronoi diagram and introduce an
                 incremental algorithm that allows its computation in $
                 {\cal O}(n^2 \log n) $ time. Our approach also yields a
                 truly simple $ {\cal O}(n \log n) $ algorithm for
                 solving the one-dimensional version of this problem,
                 where all weighted sites lie on a line.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Eder:2019:RGT,
  author =       "G{\"u}nther Eder and Martin Held and Peter Palfrader",
  title =        "Recognizing Geometric Trees as Positively Weighted
                 Straight Skeletons and Reconstructing Their Input",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "03",
  pages =        "251--267",
  month =        sep,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919500080",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Fri Oct 25 06:34:13 MDT 2019",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500080",
  abstract =     "We extend results by Biedl et al. (ISVD'13) on the
                 recognition and reconstruction of straight skeletons:
                 Given a geometric tree G, can we recognize whether G
                 resembles a weighted straight skeleton $ {\cal S} $
                 and, if so, can we reconstruct an appropriate polygonal
                 input $P$ and an appropriate positive weight function $
                 \sigma $ such that $ {\cal S}(P, \sigma) = G$ ? We show
                 that a solution polygon $P$ and a weight function $
                 \sigma $ can be found in $ O(n)$ time and space for a
                 geometric tree $G$ with $n$ faces if at most one node
                 of $G$ has two incident edges that span an angle
                 greater than $ \pi $. In addition, we show that $G$
                 implicitly encodes enough information such that all
                 other weighted bisectors of any solution $P$ can be
                 obtained from $G$ without explicitly computing $P$.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Carmi:2019:MLO,
  author =       "Paz Carmi and Farah Chanchary and Anil Maheshwari and
                 Michiel Smid",
  title =        "The Most Likely Object to be Seen Through a Window",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "4",
  pages =        "269--287",
  month =        dec,
  year =         "2019",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195919500092",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 6 09:00:29 MDT 2020",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500092",
  abstract =     "We study data structures to answer {\em window
                 queries\/} using stochastic input sequences. The first
                 problem is the {\em most likely maximal point\/} in a
                 query window: Let \alpha_1, \ldots, \alpha_c be
                 constants, with 0 < \alpha_1 < \alpha_2 < \ldots <
                 \alpha_c < 1. Let P = P_1 \cup P_2 \cup \ldots \cup P_c
                 be a set of n points in \mathbb{R}^d, for some fixed
                 $d$. For i = 1, 2, \ldots, c, each point in P_i is
                 associated with a probability \alpha_i of existence. A
                 point p = (x1, \ldots, xd) in P is on the maximal layer
                 of P if there is no other point q = (x1', \ldots, x d')
                 in P such that x1' > x 1, x2' > x 2, \ldots, and xd' >
                 x d. Consider a random subset of P obtained by
                 including, for i = 1, 2, \ldots, c, each point of P_i
                 independently with probability \alpha_i. For a query
                 interval [i, j], with i \leq j, we report the point in
                 P_{i, j} = (p_i, \ldots{}, p_j) that has the highest
                 probability to be on the maximal layer of P_i, j in
                 O(1) time using O(nlog n) space. We solve a special
                 problem as follows. A sequence P of n points in
                 {\mathbb{R}}d is given ( d \geq 2 ), where each point P
                 has a probability \in (0, 1] of existence associated
                 with it. Given a query interval [i, j] and an integer t
                 with i \leq t \leq j, we report the probability of pt
                 to be on the maximal layer of P_{i, j} in O(\log^d n)
                 time using O(n \log^d n) space. The second problem we
                 consider is the most likely common element problem. Let
                 \mathcal{U} = \{1, 2, \ldots{}, n\} be the universe.
                 Let S_1, S_2, \ldots{}, S_m be a sequence of random
                 subsets of \mathcal{U} such that for p = 1, \ldots{}, m
                 and i = 1, \ldots{}, n, element i is added to S_p with
                 probability \alpha_pi (independently of other choices).
                 Let \tau be a fixed real number with 0 < \tau \leq 1.
                 For query indices p, q, i and j, with 1 \leq p \leq q
                 \leq m and 1 \leq i \leq j \leq n, we decide whether
                 there exists an element k with i \leq k \leq j such
                 that Pr(k \in \cap_{r=p}^q S_r) \geq \tau in O(1) time
                 using O(mn) space and report these elements in O(\log n
                 + w) time, where w is the size of the output.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Pilz:2019:CQB,
  author =       "Alexander Pilz and Carlos Seara",
  title =        "Convex Quadrangulations of Bichromatic Point Sets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "4",
  pages =        "289--299",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919500109",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 6 09:00:29 MDT 2020",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500109",
  abstract =     "We consider quadrangulations of red and blue points in
                 the plane where each face is convex and no edge
                 connects two points of the same color. In particular,
                 we show that the following problem is NP-hard: Given a
                 finite set S of points with each point either red or
                 blue, does there exist a convex quadrangulation of S in
                 such a way that the predefined colors give a valid
                 vertex 2-coloring of the quadrangulation? We consider
                 this as a step towards solving the corresponding
                 long-standing open problem on monochromatic point
                 sets.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Rorabaugh:2019:BCM,
  author =       "Danny Rorabaugh",
  title =        "A Bound on a Convexity Measure for Point Sets",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "4",
  pages =        "301--306",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919500110",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 6 09:00:29 MDT 2020",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500110",
  abstract =     "A planar point set is in convex position precisely
                 when it has a convex polygonization, that is, a
                 polygonization with maximum interior angle measure at
                 most $ \pi $. We can thus talk about the convexity of a
                 set of points in terms of its min-max interior angle
                 measure. The main result presented here is a nontrivial
                 upper bound of the min-max value in terms of the number
                 of points in the set. Motivated by a particular
                 construction, we also pose a natural conjecture for the
                 best upper bound.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Berry:2019:LSP,
  author =       "Lindsay Berry and Andrew Beveridge and Jane
                 Butterfield and Volkan Isler and Zachary Keller and
                 Alana Shine and Junyi Wang",
  title =        "Line-of-Sight Pursuit in Monotone and Scallop
                 Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "4",
  pages =        "307--351",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919500122",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 6 09:00:29 MDT 2020",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919500122",
  abstract =     "We study a turn-based game in a simply connected
                 polygonal environment Q between a pursuer \mathcal{P}
                 and an adversarial evader {$ \cal E $}. Both players
                 can move in a straight line to any point within unit
                 distance during their turn. The pursuer \mathcal{P}
                 wins by capturing the evader, meaning that their
                 distance satisfies d(\mathcal{P},{$ \cal E $}) \leq 1,
                 while the evader wins by eluding capture forever. Both
                 players have a map of the environment, but they have
                 different sensing capabilities. The evader {$ \cal E $}
                 always knows the location of \mathcal{P}. Meanwhile,
                 \mathcal{P} only has line-of-sight visibility:
                 \mathcal{P} observes the evader's position only when
                 the line segment connecting them lies entirely within
                 the polygon. Therefore \mathcal{P} must search for {$
                 \cal E $} when the evader is hidden from view. We
                 provide a winning strategy for \mathcal{P} in two
                 families of polygons: monotone polygons and scallop
                 polygons. In both families, a straight line L can be
                 moved continuously over Q so that (1) L \cap Q is a
                 line segment and (2) every point on the boundary
                 \partial Q is swept exactly once. These are both
                 subfamilies of strictly sweepable polygons. The
                 sweeping motion for a monotone polygon is a single
                 translation, and the sweeping motion for a scallop
                 polygon is a single rotation. Our algorithms use rook's
                 strategy during its pursuit phase, rather than the
                 well-known lion's strategy. The rook's strategy is
                 crucial for obtaining a capture time that is linear in
                 the area of Q. For both monotone and scallop polygons,
                 our algorithm has a capture time of O(n(Q) + area(Q)),
                 where n(Q) is the number of polygon vertices.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2019:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 29 (2019)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "29",
  number =       "4",
  pages =        "353--354",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1142/S0218195919990012",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 6 09:00:29 MDT 2020",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195919990012",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bose:2020:LRC,
  author =       "Prosenjit Bose and Stephane Durocher and Debajyoti
                 Mondal and Maxime Peabody and Matthew Skala and
                 Mohammad Abdul Wahid",
  title =        "Local Routing in Convex Subdivisions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "01",
  pages =        "1--17",
  month =        mar,
  year =         "2020",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195920500016",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 5 11:36:46 MDT 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195920500016",
  abstract =     "In various wireless networking settings, node
                 locations determine a network's topology, allowing the
                 network to be modelled by a geometric graph drawn in
                 the plane. Without any additional information, local
                 geometric routing algorithms can guarantee delivery to
                 the target node only in restricted classes of geometric
                 graphs, such as triangulations. In order to guarantee
                 delivery on more general classes of geometric graphs
                 (e.g., convex subdivisions or planar subdivisions),
                 previous local geometric routing algorithms required
                 {\textTheta} \( \log n \) state bits to be stored and
                 passed with the message. We present the first local
                 geometric routing algorithm using only one state bit to
                 guarantee delivery on convex subdivisions and, when the
                 algorithm has knowledge of the incoming port (the
                 preceding node on the route), the first stateless local
                 geometric routing algorithm that guarantees delivery on
                 edge-augmented monotone subdivisions (including all
                 convex subdivisions). We also show that {\textOmega} \(
                 \log n \) state bits are necessary in planar
                 subdivisions in which faces may have three or more
                 reflex vertices.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kraft:2020:CHD,
  author =       "Daniel Kraft",
  title =        "Computing the {Hausdorff} Distance of Two Sets from
                 Their Distance Functions",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "01",
  pages =        "19--49",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0218195920500028",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 5 11:36:46 MDT 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195920500028",
  abstract =     "The Hausdorff distance is a measure of
                 (dis-)similarity between two sets which is widely used
                 in various applications. Most of the applied literature
                 is devoted to the computation for sets consisting of a
                 finite number of points. This has applications, for
                 instance, in image processing. However, we would like
                 to apply the Hausdorff distance to control and evaluate
                 optimisation methods in level-set based shape
                 optimisation. In this context, the involved sets are
                 not finite point sets but characterised by level-set or
                 signed distance functions. This paper discusses the
                 computation of the Hausdorff distance between two such
                 sets. We recall fundamental properties of the Hausdorff
                 distance, including a characterisation in terms of
                 distance functions. In numerical applications, this
                 result gives at least an exact lower bound on the
                 Hausdorff distance. We also derive an upper bound, and
                 consequently a precise error estimate. By giving an
                 example, we show that our error estimate cannot be
                 further improved for a general situation. On the other
                 hand, we also show that much better accuracy can be
                 expected for non-pathological situations that are more
                 likely to occur in practice. The resulting error
                 estimate can be improved even further if one assumes
                 that the grid is rotated randomly with respect to the
                 involved sets.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Inkulu:2020:DAV,
  author =       "R. Inkulu and K. Sowmya and Nitish P. Thakur",
  title =        "Dynamic Algorithms for Visibility Polygons in Simple
                 Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "01",
  pages =        "51--78",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S021819592050003X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 5 11:36:46 MDT 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S021819592050003X",
  abstract =     "We devise the following dynamic algorithms for both
                 maintaining as well as querying for the visibility and
                 weak visibility polygons amid vertex insertions and
                 deletions to the simple polygon. A fully-dynamic
                 algorithm for maintaining the visibility polygon of a
                 fixed point located interior to the simple polygon amid
                 vertex insertions and deletions to the simple polygon.
                 The time complexity to update the visibility polygon of
                 a point q due to the insertion (resp. deletion) of
                 vertex v to (resp. from) the current simple polygon is
                 expressed in terms of the number of combinatorial
                 changes needed to the visibility polygon of q due to
                 the insertion (resp. deletion) of v . An
                 output-sensitive query algorithm to answer the
                 visibility polygon query corresponding to any point p
                 in {$ \mathbb {R} $}^{2} amid vertex insertions and
                 deletions to the simple polygon. If p is not exterior
                 to the current simple polygon, then the visibility
                 polygon of p is computed. Otherwise, our algorithm
                 outputs the visibility polygon corresponding to the
                 exterior visibility of p . An incremental algorithm to
                 maintain the weak visibility polygon of a fixed-line
                 segment located interior to the simple polygon amid
                 vertex insertions to the simple polygon. The time
                 complexity to update the weak visibility polygon of a
                 line segment pq due to the insertion of vertex v to the
                 current simple polygon is expressed in terms of the sum
                 of the number of combinatorial updates needed to the
                 geodesic shortest path trees rooted at p and q due to
                 the insertion of v . An output-sensitive algorithm to
                 compute the weak visibility polygon corresponding to
                 any query line segment located interior to the simple
                 polygon amid both the vertex insertions and deletions
                 to the simple polygon. Each of these algorithms
                 requires preprocessing the initial simple polygon. And,
                 the algorithms that maintain the visibility polygon
                 (resp. weak visibility polygon) compute the visibility
                 polygon (resp. weak visibility polygon) with respect to
                 the initial simple polygon during the preprocessing
                 phase.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Dutta:2020:ASP,
  author =       "Binayak Dutta and Sasanka Roy",
  title =        "Approximate Shortest Paths in Polygons with
                 Violations",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "01",
  pages =        "79--95",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0218195920500041",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 5 11:36:46 MDT 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195920500041",
  abstract =     "We study the shortest k -violation path problem in a
                 simple polygon. Let P be a simple polygon in {$ \mathbb
                 {R} $}^{2} with n vertices and let s \, t be a pair of
                 points in P . Let int \( P \) represent the interior of
                 P . Let P \{\~} {\= }{$ \mathbb {R} $}^{2} \\ int \( P
                 \) represent the exterior of P . For an integer k
                 \{\textgreaterequal} 0 , the shortest k -violation path
                 problem in P is the problem of computing the shortest
                 path from s to t in P , such that at most k path
                 segments are allowed to be in P \{\~} . The subpaths of
                 a k -violation path are not allowed to bend in P \{\~}
                 . For any k , we present a \( 1 \+ 2\SGMLentity{"1d716}
                 \) factor approximation algorithm for the problem that
                 runs in O \( n^{2}{\textsigma}^{2}k \log
                 n^{2}{\textsigma}^{2} \+ n^{2}{\textsigma}^{2}k \)
                 time. Here {\textsigma} {\= }O \( \log_{{\textdelta}}
                 \( L r \) \) and {\textdelta} , L , r are geometric
                 parameters.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Nilsson:2020:HKE,
  author =       "Bengt J. Nilsson and Pawe{\l} {\. Z}yli{\'n}ski",
  title =        "How to Keep an Eye on Small Things",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "02",
  pages =        "97--120",
  month =        jun,
  year =         "2020",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195920500053",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 5 11:36:47 MDT 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195920500053",
  abstract =     "We present new results on two types of guarding
                 problems for polygons. For the first problem, we
                 present an optimal linear time algorithm for computing
                 a smallest set of points that guard a given shortest
                 path in a simple polygon having n edges. We also prove
                 that in polygons with holes, there is a constant $ c >
                 0 $ such that no polynomial-time algorithm can solve
                 the problem within an approximation factor of $ c \log
                 n $, unless P = NP. For the second problem, we present
                 a $ k + h $-FPT algorithm for computing a shortest tour
                 that sees $k$ specified points in a polygon with $h$
                 holes. We also present a $k$-FPT approximation
                 algorithm for this problem having approximation factor
                 2. In addition, we prove that the general problem
                 cannot be polynomially approximated better than by a
                 factor of $ c \log n$, for some constant $ c > 0$,
                 unless P /= NP.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Grechuk:2020:CCC,
  author =       "Bogdan Grechuk and Sittichoke Som-am",
  title =        "A Convex Cover for Closed Unit Curves has Area at
                 Least 0.0975",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "02",
  pages =        "121--139",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0218195920500065",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 5 11:36:47 MDT 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195920500065",
  abstract =     "We combine geometric methods with a numerical box
                 search algorithm to show that the minimal area of a
                 convex set in the plane which can cover every closed
                 plane curve of unit length is at least 0 {\. }0975 .
                 This improves the best previous lower bound of 0 {\.
                 }096694 . In fact, we show that the minimal area of the
                 convex hull of circle, equilateral triangle, and
                 rectangle of perimeter 1 is between 0 {\. }0975 and 0
                 {\. }09763 .",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Kerber:2020:MSE,
  author =       "Michael Kerber and Arnur Nigmetov",
  title =        "Metric Spaces with Expensive Distances",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "02",
  pages =        "141--165",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0218195920500077",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Wed May 5 11:36:47 MDT 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195920500077",
  abstract =     "In algorithms for finite metric spaces, it is common
                 to assume that the distance between two points can be
                 computed in constant time, and complexity bounds are
                 expressed only in terms of the number of points of the
                 metric space. We introduce a different model, where we
                 assume that the computation of a single distance is an
                 expensive operation and consequently, the goal is to
                 minimize the number of such distance queries. This
                 model is motivated by metric spaces that appear in the
                 context of topological data analysis. We consider two
                 standard operations on metric spaces, namely the
                 construction of a \( 1 \+ \SGMLentity{"1d700} \)
                 -spanner and the computation of an approximate nearest
                 neighbor for a given query point. In both cases, we
                 partially explore the metric space through distance
                 queries and infer lower and upper bounds for yet
                 unexplored distances through triangle inequality. For
                 spanners, we evaluate several exploration strategies
                 through extensive experimental evaluation. For
                 approximate nearest neighbors, we prove that our
                 strategy returns an approximate nearest neighbor after
                 a logarithmic number of distance queries.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wang:2020:LTA,
  author =       "Haitao Wang and Yiming Zhao",
  title =        "A Linear-Time Algorithm for Discrete Radius Optimally
                 Augmenting Paths in a Metric Space",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "3--4",
  pages =        "167--182",
  month =        sep # "--" # dec,
  year =         "2020",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195920500089",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Dec 27 07:18:15 MST 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195920500089",
  abstract =     "Let P be a path graph of n vertices embedded in a
                 metric space. We consider the problem of adding a new
                 edge to P so that the radius of the resulting graph is
                 minimized, where any center is constrained to be one of
                 the vertices of P . Previously, the ``continuous''
                 version of the problem where a center may be a point in
                 the interior of an edge of the graph was studied and a
                 linear-time algorithm was known. Our ``discrete''
                 version of the problem has not been studied before. We
                 present a linear-time algorithm for the problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gupta:2020:ETP,
  author =       "Prashant Gupta and Bala Krishnamoorthy",
  title =        "{Euler} Transformation of Polyhedral Complexes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "3--4",
  pages =        "183--211",
  month =        sep # "--" # dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0218195920500090",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Dec 27 07:18:15 MST 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195920500090",
  abstract =     "We propose an {\em Euler transformation\/} that
                 transforms a given d -dimensional cell complex K for d
                 {\= }2 \, 3 into a new d -complex K \{\^} in which
                 every vertex is part of the same even number of edges.
                 Hence every vertex in the graph {\^G} that is the 1
                 -skeleton of K \{\^} has an even degree, which makes
                 {\^G} Eulerian, i.e., it is guaranteed to contain an
                 Eulerian tour. Meshes whose edges admit Eulerian tours
                 are crucial in coverage problems arising in several
                 applications including 3D printing and robotics. For 2
                 -complexes in {$ \mathbb {R} $}^{2} ( d {\= }2 ) under
                 mild assumptions (that no two adjacent edges of a 2
                 -cell in K are boundary edges), we show that the Euler
                 transformed 2 -complex K \{\^} has a geometric
                 realization in {$ \mathbb {R} $}^{2} , and that each
                 vertex in its 1 -skeleton has degree 4 . We bound the
                 numbers of vertices, edges, and 2 -cells in K \{\^} as
                 small scalar multiples of the corresponding numbers in
                 K . We prove corresponding results for 3 -complexes in
                 {$ \mathbb {R} $}^{3} under an additional assumption
                 that the degree of a vertex in each 3 -cell containing
                 it is 3 . In this setting, every vertex in {\^G} is
                 shown to have a degree of 6 . We also present bounds on
                 parameters measuring geometric quality (aspect ratios,
                 minimum edge length, and maximum angle of cells) of K
                 \{\^} in terms of the corresponding parameters of K for
                 d {\= }2 \, 3 . Finally, we illustrate a direct
                 application of the proposed Euler transformation in
                 additive manufacturing.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Liu:2020:DRS,
  author =       "Yangwei Liu and Hu Ding and Ziyun Huang and Jinhui
                 Xu",
  title =        "Distributed and Robust Support Vector Machine",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "3--4",
  pages =        "213--233",
  month =        sep # "--" # dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0218195920500107",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Dec 27 07:18:15 MST 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195920500107",
  abstract =     "In this paper, we consider the distributed version of
                 Support Vector Machine (SVM) under the coordinator
                 model, where all input data (i.e., points in {$ \mathbb
                 {R} $}^{d} space) of SVM are arbitrarily distributed
                 among k nodes in some network with a coordinator which
                 can communicate with all nodes. We investigate two
                 variants of this problem, with and without outliers.
                 For distributed SVM without outliers, we prove a lower
                 bound on the communication complexity and give a
                 distributed \( 1 \{\textminus} \SGMLentity{"1d716} \)
                 -approximation algorithm to reach this lower bound,
                 where \SGMLentity{"1d716} is a user specified small
                 constant. For distributed SVM with outliers, we present
                 a \( 1 \{\textminus} \SGMLentity{"1d716} \)
                 -approximation algorithm to explicitly remove the
                 influence of outliers. Our algorithm is based on a
                 deterministic distributed top t selection algorithm
                 with communication complexity of O \( k \log \( t \) \)
                 in the coordinator model.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Weiss:2020:MOS,
  author =       "Bastian Wei{\ss} and Bert J{\"u}ttler and Franz
                 Aurenhammer",
  title =        "Mitered Offsets and Skeletons for Circular Arc
                 Polygons",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "3--4",
  pages =        "235--256",
  month =        sep # "--" # dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0218195921500023",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Dec 27 07:18:15 MST 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195921500023",
  abstract =     "The offsetting process that defines straight skeletons
                 of polygons is generalized to arc polygons, i.e., to
                 planar shapes with piecewise circular boundaries. The
                 offsets are obtained by shrinking or expanding the
                 circular arcs on the boundary in a co-circular manner,
                 and tracing the paths of their endpoints. These paths
                 define the associated shape-preserving skeleton, which
                 decomposes the input object into patches. While the
                 skeleton forms a forest of trees, the patches of the
                 decomposition have a radial monotonicity property.
                 Analyzing the events that occur during the offsetting
                 process is non-trivial; the boundary of the offsetting
                 object may get into self-contact and may even splice.
                 This leads us to an event-driven algorithm for offset
                 and skeleton computation. Several examples (both
                 manually created ones and approximations of planar
                 free-form shapes by arc spline curves) are analyzed to
                 study the practical performance of our algorithm.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2020:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 30 (2020)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "30",
  number =       "3--4",
  pages =        "??--??",
  month =        sep # "--" # dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0218195920990010",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Dec 27 07:18:15 MST 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195920990010",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Johnson:2021:WGD,
  author =       "Matthew Johnson and Dani{\"e}l Paulusma and Erik Jan
                 {Van Leeuwen}",
  title =        "What Graphs are 2-Dot Product Graphs?",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "01",
  pages =        "1--16",
  month =        mar,
  year =         "2021",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195921500011",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Dec 27 07:18:16 MST 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195921500011",
  abstract =     "Let d \{\textgreaterequal} 1 be an integer. From a set
                 of d -dimensional vectors, we obtain a d -dot product
                 graph by letting each vector a^{u} correspond to a
                 vertex u and by adding an edge between two vertices u
                 and v if and only if their dot product a^{u} \{\^a}
                 a^{v} \{\textgreaterequal} t , for some fixed, positive
                 threshold t . Dot product graphs can be used to model
                 social networks. Recognizing a d -dot product graph is
                 known to be NP -hard for all fixed d
                 \{\textgreaterequal} 2 . To understand the position of
                 d -dot product graphs in the landscape of graph
                 classes, we consider the case d {\= }2 , and
                 investigate how 2 -dot product graphs relate to a
                 number of other known graph classes including a number
                 of well-known classes of intersection graphs.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Nabli:2021:TTC,
  author =       "H{\'e}di Nabli",
  title =        "{Truchet} Tiles and Combinatorial Arabesque",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "01",
  pages =        "17--37",
  month =        mar,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0218195921500035",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Dec 27 07:18:16 MST 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195921500035",
  abstract =     "In this paper, we introduce a new topic on geometric
                 patterns issued from Truchet tile, that we agree to
                 call combinatorial arabesque. The originally Truchet
                 tile, by reference to the French scientist of 17th
                 century S{\'e}bastien Truchet, is a square split along
                 the diagonal into two triangles of contrasting colors.
                 We define an equivalence relation on the set of all
                 square tiling of same size, leading naturally to
                 investigate the equivalence classes and their
                 cardinality. Thanks to this class notion, it will be
                 possible to measure the beauty degree of a Truchet
                 square tiling by means of an appropriate algebraic
                 group. Also, we define many specific arabesques such as
                 entirely symmetric, magic and hyper-maximal arabesques.
                 Mathematical characterizations of such arabesques are
                 established facilitating thereby their enumeration and
                 their algorithmic generating. Finally the notion of
                 irreducibility is introduced on arabesques.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Stoimenow:2021:ENC,
  author =       "Alexander Stoimenow",
  title =        "Exchangeability and Non-Conjugacy of Braid
                 Representatives",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "01",
  pages =        "39--73",
  month =        mar,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0218195921500047",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Mon Dec 27 07:18:16 MST 2021",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195921500047",
  abstract =     "We obtain some fairly general conditions on the
                 linking numbers and geometric properties of a link,
                 under which it has infinitely many conjugacy classes of
                 n -braid representatives if and only if it has one
                 admitting an exchange move. We investigate a symmetry
                 pattern of indices of conjugate iterated exchanged
                 braids. We then develop a test based on the Burau
                 matrix showing examples of knots admitting no minimal
                 exchangeable braids, admitting non-minimal
                 non-exchangeable braids, and admitting both minimal
                 exchangeable and minimal non-exchangeable braids. This
                 in particular proves that conjugacy, exchange moves and
                 destabilization do not suffice to simplify braid
                 representatives of a general link.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gitik:2021:VDD,
  author =       "Rivka Gitik and Leo Joskowicz",
  title =        "{Voronoi} Diagram and {Delaunay} Triangulation with
                 Independent and Dependent Geometric Uncertainties",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "2--3",
  pages =        "75--121",
  month =        jun # "--" # sep,
  year =         "2021",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195921500059",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Feb 17 06:25:45 MST 2022",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195921500059",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Banerjee:2021:VGD,
  author =       "Debangshu Banerjee and R. Inkulu",
  title =        "Vertex Guarding for Dynamic Orthogonal Art Galleries",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "2--3",
  pages =        "123--140",
  month =        jun # "--" # sep,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0218195921500060",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Feb 17 06:25:45 MST 2022",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195921500060",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Blazj:2021:ELR,
  author =       "V{\'a}clav Bla{\v{z}}j and Ji{\v{r}}{\'\i} Fiala and
                 Giuseppe Liotta",
  title =        "On Edge-Length Ratios of Partial 2-Trees",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "2--3",
  pages =        "141--162",
  month =        jun # "--" # sep,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0218195921500072",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Feb 17 06:25:45 MST 2022",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195921500072",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Wang:2021:RSR,
  author =       "Haohao Wang and Ron Goldman",
  title =        "Ruled Surfaces of Revolution with Moving Axes and
                 Angles",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "2--3",
  pages =        "163--181",
  month =        jun # "--" # sep,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0218195921500084",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Feb 17 06:25:45 MST 2022",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195921500084",
  abstract =     "A ruled surface of revolution with moving axes and
                 angles is a rational tensor product surface generated
                 from a line and a rational space curve by rotating the
                 line (the directrix) around vectors and angles
                 generated by the rational space curve (the director).
                 Only right circular cylinders and right circular cones
                 are ruled surfaces that are also surfaces of
                 revolution, but we show that a rich collection of other
                 ruled surfaces such as hyperboloids of one sheet,
                 2-fold Whitney umbrellas, and a wide variety other
                 interesting ruled shapes are ruled surfaces of
                 revolution with moving axes and angles. We present a
                 fast way to compute the implicit equation of a ruled
                 surface of revolution with moving axes and angles from
                 two linearly independent vectors that are perpendicular
                 to the directrix of the surface. We also provide an
                 algorithm for determining whether or not a given
                 rational ruled surface is a ruled surface of revolution
                 with moving axes and angles.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Korotov:2021:IMA,
  author =       "Sergey Korotov and Lars Fredrik Lund and Jon Eivind
                 Vatne",
  title =        "Improved Maximum Angle Estimate for Longest-Edge
                 Bisection",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "4",
  pages =        "183--192",
  month =        dec,
  year =         "2021",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195922500017",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:54 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922500017",
  abstract =     "In this note we construct an upper estimate on the
                 maximum angles of triangles generated by the
                 longest-edge bisection algorithms applied to a
                 triangle. This upper bound considerably improves upon
                 one inherited from the well-known minimum angle
                 estimation, thus providing tighter two-sided estimation
                 of the angles generated by bisections. This estimate
                 also guarantees the validity of the maximum angle
                 condition, widely used in finite element analysis and
                 computer graphics.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Gupta:2021:SMO,
  author =       "Prashant Gupta and Yiran Guo and Narasimha Boddeti and
                 Bala Krishnamoorthy",
  title =        "{SFCDecomp}: Multicriteria Optimized Tool Path
                 Planning in {$3$D} Printing using Space-Filling Curve
                 Based Domain Decomposition",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "4",
  pages =        "193--220",
  month =        dec,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0218195921500096",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:54 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195921500096",
  abstract =     "We explore efficient optimization of toolpaths based
                 on multiple criteria for large instances of 3D printing
                 problems. We first show that the minimum turn cost 3D
                 printing problem is NP-hard, even when the region is a
                 simple polygon. We develop {\em SFCDecomp\}, a space
                 filling curve based decomposition framework to solve
                 large instances of 3D printing problems efficiently by
                 solving these optimization subproblems independently.
                 For the Buddha model, our framework builds toolpaths
                 over a total of 799,716 nodes across 169 layers, and
                 for the Bunny model it builds toolpaths over 812,733
                 nodes across 360 layers. Building on SFCDecomp, we
                 develop a multicriteria optimization approach for
                 toolpath planning. We demonstrate the utility of our
                 framework by maximizing or minimizing tool path edge
                 overlap between adjacent layers, while jointly
                 minimizing turn costs. Strength testing of a tensile
                 test specimen printed with tool paths that maximize or
                 minimize adjacent layer edge overlaps reveal
                 significant differences in tensile strength between the
                 two classes of prints.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tateiri:2021:EMA,
  author =       "Kazuma Tateiri and Toru Ohmoto",
  title =        "An Extended {MMP} Algorithm: Wavefront and Cut-Locus
                 on a Convex Polyhedron",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "4",
  pages =        "221--247",
  month =        dec,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0218195922500029",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:54 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922500029",
  abstract =     "In the present paper, we propose a novel
                 generalization of the celebrated MMP algorithm in order
                 to find the {\em wavefront propagation\/} and the {\em
                 cut-locus\/} on a convex polyhedron with an emphasis on
                 actual implementation for instantaneous visualization
                 and numerical computation.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2021:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 31 (2021)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "31",
  number =       "4",
  pages =        "??--??",
  month =        dec,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0218195921990016",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:54 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195921990016",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Adams:2022:PHC,
  author =       "Henry Adams and Sophia Coldren and Sean Willmot",
  title =        "The Persistent Homology of Cyclic Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "32",
  number =       "1--2",
  pages =        "1--37",
  month =        mar # "--" # jun,
  year =         "2022",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195922500042",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:54 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922500042",
  abstract =     "We give an O(n2(k+logn)) O \( n^{2} \( k \+ \log n \)
                 \) O(n2(k +log n)) algorithm for computing the
                 k-dimensional persistent homology of a filtration of
                 clique complexes of cyclic graphs on n vertices. This
                 is nearly quadratic in the number of vertices n, and
                 therefore a large improvement upon the traditional
                 persistent homology algorithm, which is cubic in the
                 number of simplices of dimension at most k+1 k \+ 1 k +
                 1, and hence of running time O(n3(k+2)) O \( n^{3 \( k
                 \+ 2 \)} \) O(n3(k+2)) in the number of vertices n .
                 Our algorithm applies, for example, to Vietoris--Rips
                 complexes of points sampled from a curve in Rd {$
                 \mathbb {R} $}^{d} {$ \mathbb {R} $ d} when the scale
                 is bounded depending on the geometry of the curve, but
                 still large enough so that the Vietoris--Rips complex
                 may have non-trivial homology in arbitrarily high
                 dimensions k . In the case of the plane R2 {$ \mathbb
                 {R} $}^{2} {$ \mathbb {R} $2}, we prove that our
                 algorithm applies for all scale parameters if the n
                 vertices are sampled from a convex closed
                 differentiable curve whose convex hull contains its
                 evolute. We ask if there are other geometric settings
                 in which computing persistent homology is (say)
                 quadratic or cubic in the number of vertices, instead
                 of in the number of simplices.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Milenkovic:2022:EPE,
  author =       "Victor Milenkovic and Elisha Sacks",
  title =        "Efficient Predicate Evaluation Using Randomized
                 Degeneracy Detection",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "32",
  number =       "1--2",
  pages =        "39--54",
  month =        mar # "--" # jun,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0218195922500054",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:54 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922500054",
  abstract =     "Computational geometry algorithms branch on the signs
                 of predicates. Prior predicate evaluation techniques
                 are slow on degenerate (zero sign) predicates,
                 especially on predicates on algebraic numbers.
                 Degeneracy is common for predicates whose arguments
                 have common antecedents. We present three randomized
                 algorithms for degeneracy detection. The first
                 algorithm uses modular arithmetic to detect degenerate
                 predicates on rational numbers. The second algorithm
                 uses quotient rings to reduce detecting degenerate
                 predicates on algebraic numbers to multiple rational
                 predicates, which can be evaluated deterministically or
                 using the first algorithm. This algorithm is
                 impractical because it is exponential in the number of
                 algebraic numbers, yet it is still much faster than
                 prior work that uses root separation bounds. The third
                 algorithm uses a perturbation to eliminate degenerate
                 algebraic predicates that are not identical to zero and
                 a second perturbation to detect those that are. The
                 first and third algorithms are incorporated into an
                 exact geometric computation library. By sampling values
                 generated by the algorithms, the library estimates the
                 degeneracy detection failure probability over the
                 lifetime of every calling program. We call this
                 approach statistical degeneracy detection (SDD).
                 Extensive testing shows that predicate evaluation is
                 reliable and fast.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Provatidis:2022:NRR,
  author =       "Christopher G. Provatidis",
  title =        "Non-Rational and Rational Transfinite Interpolation
                 Using {Bernstein} Polynomials",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "32",
  number =       "1--2",
  pages =        "55--89",
  month =        mar # "--" # jun,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0218195922500030",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:54 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922500030",
  abstract =     "It is shown that the standard transfinite
                 interpolation in quadrilateral patches may be written
                 in terms of two sets of Bernstein polynomials. The
                 former set is of the same degree with the corresponding
                 blending functions while the latter is of the same
                 degree with the Lagrange polynomials which operate like
                 trial functions along each of the four edges as well as
                 the additional inter-boundaries of the patch. The
                 replacement of the Lagrange polynomials by the
                 Bernstein ones allows the use of control points useful
                 for design. Also it allows the determination of weights
                 that may ensure accurate representation of quadric
                 surfaces including those of revolution (spheres,
                 ellipsoids, hyperboloids, etc). The presentation
                 restricts to the standard Gordon formulation, which
                 refers to structured stencils, similar to rectangular
                 plates reinforced with longitudinal and transverse
                 stiffeners. As an example, the proposed formula is
                 applied to the geometric representation of a
                 cylindrical and a spherical patch. In the latter case a
                 nonlinear programming optimization technique was
                 applied, starting with initial data pertinent to a
                 tensor product surface, from which original weights and
                 control points were obtained for the accurate
                 representation of a spherical cap. In addition, the
                 involved shape functions were successfully applied to
                 the numerical solution of a boundary value problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Fasy:2022:RGS,
  author =       "Brittany Terese Fasy and Rafal Komendarczyk and
                 Sushovan Majhi and Carola Wenk",
  title =        "On the Reconstruction of Geodesic Subspaces of {$
                 \mathbb {R}^N $}",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "32",
  number =       "1--2",
  pages =        "91--117",
  month =        mar # "--" # jun,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0218195922500066",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:54 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922500066",
  abstract =     "We consider the topological and geometric
                 reconstruction of a geodesic subspace of RN {$ \mathbb
                 {R} $}^{N} {$ \mathbb {R} $N} both from the {\v{C}}ech
                 and Vietoris-Rips filtrations on a finite,
                 Hausdorff-close, Euclidean sample. Our reconstruction
                 technique leverages the intrinsic length metric induced
                 by the geodesics on the subspace. We consider the
                 distortion and convexity radius as our sampling
                 parameters for the reconstruction problem. For a
                 geodesic subspace with finite distortion and positive
                 convexity radius, we guarantee a correct computation of
                 its homotopy and homology groups from the sample. This
                 technique provides alternative sampling conditions to
                 the existing and commonly used conditions based on weak
                 feature size and {\textmu}-reach, and performs better
                 under certain types of perturbations of the geodesic
                 subspace. For geodesic subspaces of R2 {$ \mathbb {R}
                 $}^{2} {$ \mathbb {R} $2}, we also devise an algorithm
                 to output a homotopy equivalent geometric complex that
                 has a very small Hausdorff distance to the unknown
                 underlying space.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Guigues:2022:ALE,
  author =       "Vincent Guigues",
  title =        "Algorithms and a Library for the Exact Computation of
                 the Cumulative Distribution Function of the {Euclidean}
                 Distance Between a Point and a Random Variable
                 Uniformly Distributed in Disks, Balls, or Polygones and
                 Application to Probabilistic Seismic Hazard Analysis",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "32",
  number =       "3--4",
  pages =        "119--174",
  month =        sep # "--" # dec,
  year =         "2022",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195922500091",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:56 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922500091",
  abstract =     "We consider a random variable expressed as the
                 Euclidean distance between an arbitrary point and a
                 random variable uniformly distributed in a closed and
                 bounded set of a three-dimensional Euclidean space.
                 Four cases are considered for this set: a union of
                 disjoint disks, a union of disjoint balls, a union of
                 disjoint line segments, and the boundary of a
                 polyhedron. In the first three cases, we provide
                 closed-form expressions of the cumulative distribution
                 function and the density. In the last case, we propose
                 two algorithms with complexity O(nlnn) O \( n \ln n \)
                 O(nln n), n being the number of edges of the
                 polyhedron, that computes exactly the cumulative
                 distribution function. An application of these results
                 to probabilistic seismic hazard analysis and extensions
                 are discussed. Finally, we present an open source
                 library, available at
                 https://github.com/vguigues/Areas_Library, that
                 implements the algorithms presented in this paper.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Bhattacharjee:2022:VFT,
  author =       "Sukanya Bhattacharjee and R. Inkulu",
  title =        "Vertex Fault-Tolerant Geometric Spanners for Weighted
                 Points",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "32",
  number =       "3--4",
  pages =        "175--199",
  month =        sep # "--" # dec,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S021819592250008X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:56 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S021819592250008X",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Huang:2022:RPR,
  author =       "Jiawei Huang and Ruizhe Qin and Fan Yang and Hu Ding",
  title =        "Random Projection and Recovery for High Dimensional
                 Optimization with Arbitrary Outliers",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "32",
  number =       "3--4",
  pages =        "201--225",
  month =        sep # "--" # dec,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0218195922500078",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:56 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922500078",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2022:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 32 (2022)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "32",
  number =       "3--4",
  pages =        "??--??",
  month =        sep # "--" # dec,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0218195922990011",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:56 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922990011",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Hon:2023:GEF,
  author =       "Wing-kai Hon and Chung-shou Liao and Meng-tsung Tsai",
  title =        "{Guest Editors}' Foreword",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "1--2",
  pages =        "1--2",
  month =        mar # "--" # jun,
  year =         "2023",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195923020016",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:57 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195923020016",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  remark =       "Special Issue: Simplicity in Geometric Computing Guest
                 Editors: Wing-Kai Hon, Chung-Shou Liao and Meng-Tsung
                 Tsai",
}

@Article{Gagie:2023:RW,
  author =       "Travis Gagie and Mozhgan Saeidi and Allan Sapucaia",
  title =        "Ruler Wrapping",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "1--2",
  pages =        "3--12",
  month =        mar # "--" # jun,
  year =         "2023",
  DOI =          "https://doi.org/10.1142/S0218195922410011",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:57 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922410011",
  abstract =     "In 1985 Hopcroft, Joseph and Whitesides showed it is
                 NP-complete to decide whether a carpenter's ruler with
                 segments of given positive lengths can be folded into
                 an interval of at most a given length, such that the
                 folded hinges alternate between 180 degrees clockwise
                 and 180 degrees counter-clockwise. At the open-problem
                 session of 33rd Canadian Conference on Computational
                 Geometry (CCCG '21), O'Rourke proposed a natural
                 variation of this problem called {\em ruler wrapping\},
                 in which all folded hinges must be folded the same way.
                 In this paper we show O'Rourke's variation has a
                 linear-time solution.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  remark =       "Special Issue: Simplicity in Geometric Computing Guest
                 Editors: Wing-Kai Hon, Chung-Shou Liao and Meng-Tsung
                 Tsai",
}

@Article{Nakano:2023:CPA,
  author =       "Shin-ichi Nakano",
  title =        "The Coverage Problem by Aligned Disks",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "1--2",
  pages =        "13--23",
  month =        mar # "--" # jun,
  year =         "2023",
  DOI =          "https://doi.org/10.1142/S0218195922410023",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:57 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922410023",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  remark =       "Special Issue: Simplicity in Geometric Computing Guest
                 Editors: Wing-Kai Hon, Chung-Shou Liao and Meng-Tsung
                 Tsai",
}

@Article{Durocher:2023:BCS,
  author =       "Stephane Durocher and J. Mark Keil and Saeed Mehrabi
                 and Debajyoti Mondal",
  title =        "Bottleneck Convex Subsets: Finding $k$ Large Convex
                 Sets in a Point Set",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "1--2",
  pages =        "25--41",
  month =        mar # "--" # jun,
  year =         "2023",
  DOI =          "https://doi.org/10.1142/S0218195922410035",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:57 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922410035",
  abstract =     "Chv{\'a}tal and Klincsek (1980) gave an O(n3) O \(
                 n^{3} \) O(n3) -time algorithm for the problem of
                 finding a maximum-cardinality convex subset of an
                 arbitrary given set p of n points in the plane. This
                 paper examines a generalization of the problem, the
                 {\em Bottleneck Convex Subsets\/} problem: given a set
                 p of n points in the plane and a positive integer k,
                 select k pairwise disjoint convex subsets of p such
                 that the cardinality of the smallest subset is
                 maximized. Equivalently, a solution maximizes the
                 cardinality of k mutually disjoint convex subsets of p
                 of equal cardinality. We give an algorithm that solves
                 the problem exactly, with running time polynomial in n
                 when k is fixed. We then show the problem to be NP-hard
                 when k is an arbitrary input parameter, even for points
                 in general position. Finally, we give a fixed-parameter
                 tractable algorithm parameterized in terms of the
                 number of points strictly interior to the convex
                 hull.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  remark =       "Special Issue: Simplicity in Geometric Computing Guest
                 Editors: Wing-Kai Hon, Chung-Shou Liao and Meng-Tsung
                 Tsai",
}

@Article{Lee:2023:FDN,
  author =       "Kuo-kai Lee and Wing-kai Hon and Chung-shou Liao and
                 Kunihiko Sadakane and Meng-tsung Tsai",
  title =        "Fully Dynamic No-Back-Edge-Traversal Forest via
                 {$2$D}-Range Queries",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "1--2",
  pages =        "43--54",
  month =        mar # "--" # jun,
  year =         "2023",
  DOI =          "https://doi.org/10.1142/S0218195922410047",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu Mar 23 12:40:57 MDT 2023",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 http://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195922410047",
  abstract =     "Orthogonal range search is ubiquitous nowadays, with
                 natural applications in databases, data mining, and
                 text indexing. Very recently, yet another application
                 was discovered, which is to maintain a DFS forest in a
                 dynamic graph. In this paper, we want to extend the
                 above recent study, by applying orthogonal range search
                 to efficient maintenance of a BFS-like forest, called
                 {\em no-back-edge-traversal\/} (NBET) forest, which
                 refers to a spanning forest obtained from a traversal
                 that does not create any back edge. The study of such a
                 problem is motivated by the fact that NBET forest can
                 be used as a strong certificate of 2-connectivity of an
                 undirected graph, which is more general than a spanning
                 forest obtained from a scan-first search traversal.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
  remark =       "Special Issue: Simplicity in Geometric Computing Guest
                 Editors: Wing-Kai Hon, Chung-Shou Liao and Meng-Tsung
                 Tsai",
}

@Article{Yang:2023:TPS,
  author =       "Chao Yang",
  title =        "Tiling the Plane with a Set of Ten Polyominoes",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "3--4",
  pages =        "55--64",
  month =        sep # "--" # dec,
  year =         "2023",
  CODEN =        "IJCAEV",
  DOI =          "https://doi.org/10.1142/S0218195923500012",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu May 23 07:06:54 MDT 2024",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 https://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195923500012",
  abstract =     "There exists a linear algorithm to decide whether a
                 polyomino tessellates the plane by translation only. On
                 the other hand, the problem of deciding whether a set
                 of 11 11 11 or more polyominoes can tile the plane by
                 translation is undecidable. We narrow the gap between
                 decidable and undecidable by showing that it remains
                 undecidable for a set of 10 10 10 polyominoes, which
                 partially solves a conjecture posed by Ollinger.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Benroummane:2023:SRS,
  author =       "Abderrazzak Benroummane",
  title =        "Some Results on Semi-Symmetric Spaces",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "3--4",
  pages =        "65--84",
  month =        sep # "--" # dec,
  year =         "2023",
  DOI =          "https://doi.org/10.1142/S0218195923500024",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu May 23 07:06:54 MDT 2024",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 https://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195923500024",
  abstract =     "We give some properties of semi-symmetric
                 pseudo-Riemannian manifolds as an indecomposable
                 irreducible Ricci pseudo-Riemannian manifold (i.e. the
                 minimal polynomial of its Ricci operator is
                 irreducible) is semi symmetric if and only if it is
                 locally symmetric. We also show that any semi-symmetric
                 pseudo-Riemannian manifold will be foliated. Moreover,
                 if the metric is Lorentzian, the Ricci operator has
                 only real eigenvalues and more precisely, on each leaf,
                 it is diagonalizable with at most a single non zero
                 eigenvalue or isotropic.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Korotov:2023:DAS,
  author =       "Sergey Korotov and Jon Eivind Vatne",
  title =        "On Dihedral Angle Sums of Prisms and Hexahedra",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "3--4",
  pages =        "85--95",
  month =        sep # "--" # dec,
  year =         "2023",
  DOI =          "https://doi.org/10.1142/S0218195923500036",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu May 23 07:06:54 MDT 2024",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 https://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195923500036",
  abstract =     "Various angle characteristics are used (e.g. in finite
                 element methods or computer graphics) when evaluating
                 the quality of computational meshes which may consist,
                 in the three-dimensional case, of tetrahedra, prisms,
                 hexahedra and pyramids. Thus, it is of interest to
                 derive (preferably tight) bounds for dihedral angle
                 sums, i.e. sums of angles between faces, of such mesh
                 elements. For tetrahedra this task was solved by Gaddum
                 in 1952. For pyramids, this was resolved by Korotov,
                 Lund and Vatne in 2022. In this paper, we compute tight
                 bounds for the remaining two cases, hexahedra and
                 prisms.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Tateiri:2023:EEE,
  author =       "Kazuma Tateiri",
  title =        "Efficient Exact Enumeration of Single-Source Geodesics
                 on a Non-Convex Polyhedron",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "3--4",
  pages =        "97--132",
  month =        sep # "--" # dec,
  year =         "2023",
  DOI =          "https://doi.org/10.1142/S0218195923500048",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu May 23 07:06:54 MDT 2024",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 https://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195923500048",
  abstract =     "In this paper, we consider enumeration of geodesics on
                 a polyhedron, where a geodesic means locally-shortest
                 path between two points. Particularly, we consider the
                 following preprocessing problem: given a point s s s on
                 a polyhedral surface and a positive real number r r r ,
                 to build a data structure that enables, for any point t
                 t t on the surface, to enumerate all geodesics from s s
                 s to t t t whose length is less than r r r . First, we
                 present a naive algorithm by removing the trimming
                 process from the MMP algorithm (1987). Next, we present
                 an improved algorithm which is practically more
                 efficient on a non-convex polyhedron, in terms of
                 preprocessing time and memory consumption. Moreover, we
                 introduce a {\em single-pair geodesic graph\/} to
                 succinctly encode a result of geodesic query. Lastly,
                 we compare these naive and improved algorithms by some
                 computer experiments.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Jana:2023:MBS,
  author =       "Satyabrata Jana and Anil Maheshwari and Saeed Mehrabi
                 and And Sasanka Roy",
  title =        "Maximum Bipartite Subgraphs of Geometric Intersection
                 Graphs",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "3--4",
  pages =        "133--157",
  month =        sep # "--" # dec,
  year =         "2023",
  DOI =          "https://doi.org/10.1142/S021819592350005X",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu May 23 07:06:54 MDT 2024",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 https://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S021819592350005X",
  abstract =     "We study the {\em Maximum Bipartite Subgraph\/} ( MBS
                 MBS MBS ) problem, which is defined as follows. Given a
                 set S S S of n n n geometric objects in the plane, we
                 want to compute a maximum-size subset S{\prime}{\^a} S
                 S^{{\prime}} \{\^a} S S{\prime}{\^a} S such that the
                 intersection graph of the objects in S{\prime}
                 S^{{\prime}} S{\prime} is bipartite. We first give an
                 O(n2) O \( n^{2} \) O(n2) -time algorithm that computes
                 an almost optimal solution for the problem on
                 circular-arc graphs. We show that the MBS MBS MBS
                 problem is NP NP NP -hard on geometric graphs for which
                 the maximum independent set is NP NP NP -hard (hence,
                 it is NP NP NP -hard even on unit squares and unit
                 disks). On the other hand, we give a PTAS PTAS PTAS for
                 the problem on unit squares and unit disks. Moreover,
                 we show fast approximation algorithms with
                 small-constant factors for the problem on unit squares,
                 unit disks, and unit-height axis parallel rectangles.
                 Additionally, we prove that the {\em Maximum
                 Triangle-free Subgraph\/} ( MTFS MTFS MTFS ) problem is
                 NP-hard for axis-parallel rectangles. Here the
                 objective is the same as that of the MBS MBS MBS except
                 the intersection graph induced by the set S{\prime}
                 S^{{\prime}} S{\prime} needs to be triangle-free only
                 (instead of being bipartite).",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}

@Article{Anonymous:2023:AIV,
  author =       "Anonymous",
  title =        "Author Index Volume 33 (2023)",
  journal =      j-INT-J-COMPUT-GEOM-APPL,
  volume =       "33",
  number =       "3--4",
  pages =        "??--??",
  month =        sep # "--" # dec,
  year =         "2023",
  DOI =          "https://doi.org/10.1142/S0218195923990017",
  ISSN =         "0218-1959",
  ISSN-L =       "0218-1959",
  bibdate =      "Thu May 23 07:06:54 MDT 2024",
  bibsource =    "http://ejournals.wspc.com.sg/ijcga/;
                 https://www.math.utah.edu/pub/tex/bib/ijcga.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0218195923990017",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computational Geometry and
                 Applications (IJCGA)",
  journal-URL =  "http://www.worldscientific.com/loi/ijcga",
}