- Surface reconstruction using umbrella filters, AdaGieJoh-CGTA-02
- Polygon decomposition for efficient construction of Minkowski sums, AgaFlaHal-CGTA-02
- Cylindrical static and kinetic binary space partitions, AgaGuiMur-CGTA-00
- The power crust, unions of balls, and the medial axis transform, AmeChoKol-CGTA-01
- An algorithmic study of manufacturing paperclips and other folded structures, ArkFekMit-CGTA-03
- The common exterior of convex polygons in the plane, AroSha-CGTA-97
- $r$-regular shape reconstruction from unorganized points, Att-CGTA-98
- Offset-polygon annulus placement problems, BarBriDic-CGTA-98
- On triangulating three-dimensional polygons, BarDicEpp-CGTA-98
- Translating a convex polygon to contain a maximum number of points, BarDicPau-CGTA-97
- Computing half-plane and strip discrepancy of planar point sets, Ber-CGTA-96
- On simplifying dot maps, BerBosChe-CGTA-04
- Ununfoldable polyhedra with convex faces, BerDemEpp-CGTA-03
- Orienting polyhedral parts by pushing, BerOveSta-CGTA-02
- Natural neighbor coordinates of points on a surface, BoiCaz-CGTA-01
- Triangulations in CGAL, BoiDevPio-CGTA-02
- More planar two-center algorithms, Cha-CGTA-99
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation, CheLee-CGTA-02
- LMT-skeleton heuristics for several new classes of optimal triangulations, DaiKatChe-CGTA-00
- Hinged dissections of polyominoes and polyforms, DemDemEpp-CGTA-05
- Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami, DemDemMit-CGTA-00
- Curve reconstruction: connecting dots with good reason, DeyMehRam-CGTA-00
- Reconstructing curves with sharp corners, DeyWen-CGTA-01
- Algorithms for drawing graphs: an annotated bibliography, diBEadTam-CGTA-94
- Algorithms for proximity problems in higher dimensions, DicEpp-CGTA-96
- Optimal placement of convex polygons to maximize point containment, DicSch-CGTA-98
- Drawings of planar graphs with few slopes and segments, DujEppSud-CGTA-07
- Enumerating triangulation paths, DumGaePed-CGTA-01
- Computing the smallest $k$-enclosing circle and related problems, EfrShaZiv-CGTA-94
- Enumerating a subset of the integer points inside a Minkowski sum, Emi-CGTA-02
- Beta-skeletons have unbounded dilation, Epp-CGTA-02
- The farthest point Delaunay triangulation minimizes angles, Epp-CGTA-92
- Average case analysis of dynamic geometric optimization, Epp-CGTA-96
- Faster geometric $k$-point MST approximation, Epp-CGTA-97
- Linear complexity hexahedral mesh generation, Epp-CGTA-99
- Tiling space and slabs with acute tetrahedra, EppSulUng-CGTA-04
- Minimum dilation stars, EppWor-CGTA-07
- Sequential and parallel algorithms for finding a maximum convex polygon, Fis-CGTA-97
- Extending range queries and nearest neighbors, FlaSte-CGTA-00
- Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited, Fre-CGTA-02
- Fast randomized parallel methods for planar convex hull construction, GhoGoo-CGTA-97
- Higher order Delaunay triangulations, GudHamKre-CGTA-02
- Erased arrangements of lines and convex decompositions of polyhedra, HerSur-CGTA-98
- Complexity of projected images of convex subdivisions, HirMatTan-CGTA-94
- One strike against the min-max degree triangulation problem , Jan-CGTA-93
- A geometric proof of the combinatorial bounds for the number of optimal solutions for the 2-center Euclidean problem, JarKow-CGTA-99
- Discrete rectilinear 2-center problems, KatKedSeg-CGTA-00
- Computing a subgraph of the minimum weight triangulation, Kei-CGTA-94
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the $2D$ case, LemMor-CGTA-00
- Approximating the maxmin-angle covering triangulation, Mit-CGTA-97
- Computational geometry column 42, MitORo-IJCGA-01
- Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations, MucSaiZhu-CGTA-99
- Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation, Mue-CGTA-02
- Optimal tetrahedralization of the 3d-region “between” a convex polyhedron and a convex polygon, Pal-CGA-96
- Regular and non-regular point sets: Properties and reconstruction, PetBoy-CGTA-01
- Converting triangulations to quadrangulations, RamRamTou-CGTA-98
- Geometric applications of posets, SegKed-CGTA-98
- Delaunay refinement algorithms for triangular mesh generation, She-CGTA-02
- Combinatorial aspects of geometric graphs, Ten-CGTA-98