Int. J. Computational Geometry & Applications
- A simple algorithm for homeomorphic surface reconstruction, AmeChoDey-IJCGA-02
- DCEL: a polyhedral database and programming environment, Bar-IJCGA-98
- Solution-based mesh quality for triangular and tetrahedral meshes, Ber-IJCGA-00
- Triangulating polygons without large angles, BerDobEpp-IJCGA-95
- Quadrilateral meshing by circle packing, BerEpp-IJCGA-00
- Polynomial-size non-obtuse triangulation of polygons, BerEpp-IJCGA-92
- Polynomial-size non-obtuse triangulation of polygons, BerEpp-IJCGA-92-err
- Parallel construction of quadtrees and quality triangulations, BerEppTen-IJCGA-99
- The expected extremes in a Delaunay triangulation, BerEppYao-IJCGA-91
- Sparse arrangements and the number of views of polyhedral scenes, BerHalOve-IJCGA-97
- On enumerating and selecting distances, Cha-IJCGA-01
- Optimal polygon cover problems and applications, CheHuWu-IJCGA-02
- Topological peeling and applications, CheXu-IJCGA-03
- Approximating center points with iterated Radon points, ClaEppMil-IJCGA-96
- Computational geometry column 37, DemORo-IJCGA-00
- Fast reconstruction of curves with sharp corners, DeyWen-IJCGA-02
- Point set labeling with specified positions, DodMarMor-IJCGA-02
- A survey of object-space hidden surface removal, Dor-IJCGA-94
- Adaptive simplicial grids from cross-sections of monotone complexes, EdeWau-IJCGA-00
- Tree-weighted neighbors and geometric $k$ smallest spanning trees, Epp-IJCGA-94
- Faster circle packing with application to nonobtuse triangulation, Epp-IJCGA-97
- A cost/benefit analysis of simplicial mesh improvement techniques as measured by solution efficiency, FreGoo-IJCGA-00
- Computing a double-ray center for a planar point set, GloKedShp-IJCGA-99
- An improved ray shooting method for constructive solid geometry models via tree contraction, Goo-IJCGA-98
- Polyhedral assembly partitioning using maximally covered cells in arrangements of convex polytopes, GuiHalHir-IJCGA-98
- A more compact visibility representation, Kan-IJCGA-97
- Finding $k$ farthest pairs and $k$ closest/farthest bichromatic pairs for points in the plane, KatIwa-IJCGA-95
- Parametric polymatroid optimization and its geometric applications, KatTamTok-IJCGA-02
- Minimum number of pieces in a convex partition of a polygonal domain, Mar-IJCGA-99
- Data generation for geometric algorithms on non-uniform distributions, MilTalTen-IJCGA-99
- Finding a covering triangulation whose maximum angle is provably small, Mit-IJCGA-97
- Query-sensitive ray shooting, MitMouSur-IJCGA-97
- Quantile approximation for robust statistical estimation and kappa-enclosing problems , MouNetPia-IJCGA-00
- High quality quadrilateral surface meshing without template restrictions: a new approach based on network flow techniques, Mue-IJCGA-00
- A point-placement strategy for conforming Delaunay tetrahedralization, MurMouGab-IJCGA-01
- Computational geometry column 38, ORo-IJCGA-00
- Computational geometry column 23, ORo-IJCGA-94
- Computational geometry column 36, ORo-IJCGA-99
- A case study in algorithm engineering for geometric computing, TamVis-IJCGA-01
- Unstructured mesh generation: Theory, practice, and perspectives, TenWon-IJCGA-00
- Efficient approximation algorithms for two-label point labeling, ZhuPoo-IJCGA-01
- Fast software for box intersection, ZomEde-IJCGA-02
