%------------------------------------------
% Polygons triangulation
%------------------------------------------
@article
 {tar,
  author="R. Tarjan ant others",
  title="An $O(n\ log\ log\ n)$-time algorithm for
         triangulating a simple polygon",
  journal="SIAM J. Comp.",
  year="1988",
  volume="17",
  number="1",
  pages="143-178",
 }


%------------------------------------------
% Polyhedra intersections
%------------------------------------------
@article
 {,
  author="B.R Vatti",
  title="A Generic Solution to Polygon Clipping",
  journal="Communications of the ACM",
  year="1992",
  volume="35",
  number="7",
  pages="56-63"
}



@article
 {bw,
  author="JL Bentley and D. Wood",
  title="An optimal worst case algorithm for reporting intersections
         of rectangles",
  journal="IEEE Transactions on Computers",
  year="1980",
  volume="C-29",
  number="7",
  pages=""
}

@article
 {em,
  author="H. Edelsbrunner and H. Maurer",
  title="Polygonal intersection searching",
  journal="Information Processing Letters",
  year="1982",
  volume="14",
  number="2",
  pages="74-79"
}



@article
 {do,
  author="P. Dobkin and G. Kirkpatrick",
  title="Fast Detection of Polyhedral Intersection",
  journal="Therical Computer Science",
  year="1983",
  volume="27",
  number="",
  pages="241-253"
}


@article
 {gun,
  author="O. Gunter and E. Wong",
  title="A dual approach to detect polyhedral intersections
         in arbitrary dimensions",
  journal="B.I.T",
  year="1991",
  volume="31",
  number="",
  pages="2-14",
 }


@article
 {,
  author="H. Edelsbrunner and others",
  title="Polygonal intersection searching",
  journal="IPL",
  year="82",
  volume="14",
  number="2",
  pages=""
}

@article
 {,
  author="B. Chazelle and P. Dobkin",
  title="Intersection of convex objects in two and three
         dimensions",
  journal="J. of the ACM",
  year="1987",
  volume="34",
  number="1",
  pages="1-27"
}

@article
 {,
  author="D. Avis and T. Gum and G. Toussaint",
  title="Visibility between two edges of a simple polygon",
  journal="The Visual Computer",
  year="1986",
  volume="2",
  number="",
  pages="342-357"
}




%------------------------------------------
% Convolutions - Minkowsky
%------------------------------------------
@article
 {gs,
  author="L. Guibas and R. Seidel",
  title="Computing convolutions by reciprocal search",
  journal="Discrete and computational geometry",
  year="1987",
  volume="2",
  number="",
  pages="175-193"
}

@inproceedings
 {,
  author="L. Guibas and L. Ramshaw and J. Stolfi",
  title="A Kinetic framework for computational geometry",
  booktitle="IEEE FOCS",
  address="",
  year="1983",
  pages=""
}


@inproceedings
 {,
  author="A.Kaul and others",
  title="Computing Minkowski sums of regular polygons",
  booktitle="$3^{d}$ Canadian Conference on Computational 
             Geometry",
  address="",
  year="1991",
  pages=""
}

%------------------------------------------
% Approximations
%------------------------------------------
@inproceedings
 {,
  author="K. Clarkson",
  title="Algorithms for polytope covering and approximation",
  booktitle="WADS",
  address="",
  year="1993",
  pages=""
}