Alper Üngör

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

An Iterative Refinement Scheme of Dominating Guards and Witnesses for Art Gallery Problems.

[BibT_eX]

Eyüp Serdar Ayaz

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2014

Finding a Curve in a Point Set.

[BibT_eX]

[DOI]

CoRR, 2014

Matching Curves to Imprecise Point Sets using Fréchet Distance.

[BibT_eX]

[DOI]

CoRR, 2014

Approximate Matching of Curves to Point Sets.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2012

Hardness Results on Curve/Point Set Matching with Fréchet Distance

[BibT_eX]

[DOI]

CoRR, 2012

2011

Geometric computation with smart pixels.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2009

Quality Triangulations with Locally Optimal Steiner Points.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2009

Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Computing Triangulations without Small and Large Angles.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Symposium on Voronoi Diagrams, 2009

Mesh Smoothing Algorithms for Complex Geometric Domains.

[BibT_eX]

[DOI]

Chunchun Zhao

Proceedings of the 18th International Meshing Roundtable, 2009

2007

Parallel Delaunay Refinement: Algorithms and Analyses.

[BibT_eX]

[DOI]

Daniel A. Spielman

Int. J. Comput. Geom. Appl., 2007

Triangulations with locally optimal Steiner points.

[BibT_eX]

[DOI]

Proceedings of the Fifth Eurographics Symposium on Geometry Processing, Barcelona, 2007

Construction of Sparse Well-spaced Point Sets for Quality Tetrahedralizations.

[BibT_eX]

[DOI]

Ravi Jampani

Proceedings of the 16th International Meshing Roundtable, 2007

Computing Acute and Non-obtuse Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Triangulations Loosing Bundles and Weight.

[BibT_eX]

[DOI]

Cem Boyaci

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Guest editorial: Thirteenth International Meshing Roundtable special issue.

[BibT_eX]

[DOI]

Eng. Comput., 2006

2005

Guest editors' foreword.

[BibT_eX]

[DOI]

Paul Chew

Int. J. Comput. Geom. Appl., 2005

Building spacetime meshes over arbitrary spatial domains.

[BibT_eX]

[DOI]

Eng. Comput., 2005

Twelfth International Meshing Roundtable special issue.

[BibT_eX]

[DOI]

Eng. Comput., 2005

Quality triangulations made smaller.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

A time-optimal delaunay refinement algorithm in two dimensions.

[BibT_eX]

[DOI]

Sariel Har-Peled

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Tiling space and slabs with acute tetrahedra.

[BibT_eX]

[DOI]

David Eppstein

John M. Sullivan

Comput. Geom., 2004

Time complexity of practical parallel steiner point insertion algorithms.

[BibT_eX]

[DOI]

Daniel A. Spielman

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Parallel Delaunay Refinement with Off-Centers.

[BibT_eX]

[DOI]

Daniel A. Spielman

Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003

Approximation Algorithms for Degree-Constrained Bipartite Network Flow.

[BibT_eX]

[DOI]

Elif Akçali

Proceedings of the Computer and Information Sciences, 2003

2002

Parallel Delaunay Refinement and Space -Time Meshing

[BibT_eX]

[DOI]

PhD thesis, 2002

Pitching Tents in Space-Time: Mesh Generation for Discontinuous Galerkin Method.

[BibT_eX]

[DOI]

Alla Sheffer

Int. J. Found. Comput. Sci., 2002

Relaxed Scheduling in Dynamic Skin Triangulation.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Building Space-Time Meshes Over Arbitrary Spatial Domains.

[BibT_eX]

[DOI]

Proceedings of the 11th International Meshing Roundtable, 2002

2001

Efficient Adaptive Meshing of Parametric Models.

[BibT_eX]

[DOI]

Alla Sheffer

J. Comput. Inf. Sci. Eng., 2001

Tiling 3d euclidean space with acute tetrahedra.

[BibT_eX]

[DOI]

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Smoothing and cleaning up slivers.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Tent-Pitcher: A Meshing Algorithm for Space-Time Discontinuous Galerkin Methods.

[BibT_eX]

[DOI]

Alla Sheffer

Proceedings of the 9th International Meshing Roundtable, 2000

1999

Simultaneous Refinement and Coarsening for Adaptive Meshing.

[BibT_eX]

[DOI]

Eng. Comput., 1999

Biting Ellipses to Generate Anisotropic Mesh.

[BibT_eX]

[DOI]

Proceedings of the 8th International Meshing Roundtable, 1999

Biting Spheres in 3D.

[BibT_eX]

[DOI]

Proceedings of the 8th International Meshing Roundtable, 1999

1998

Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries.

[BibT_eX]

[DOI]