Premium Quality Triangulations.
Departamento de Ciencias de la Computación, Universidad de Chile, July 2009.
Software for computing acute and non-obtuse triangulations
of complex geometric domains.
European Conference on Numerical Mathematics and Advanced Applications (ENUMATH),
Uppsala, Sweden. July 2009.
Computing Triangulations with No Small No Large Angles,
International Symposium on Voronoi Diagrams (ISVD), Copenhagen, Denmark, June 2009.
Premium Quality Triangulations.
Computational Science and Engineering, University of Illinois Urbana-Champaign, May 2009.
On the integration of mesh refinement and smoothing.
Workshop on mesh quality measurement and improvement.
{\em SIAM Conference on Computational Science and Engineering,}
Miami, FL, March 2009.
Short Course on Theoretical Foundations of Mesh Generation.
{\em International Meshing Roundtable,} Pittsburgh October 2008.
Computing Acute and Non-obtuse Triangulations,
Canadian Conference on Computational Geometry (CCCG), Ottawa, Canada, 2007.
Triangulations Loosing Bundles and Weight,
Canadian Conference on Computational Geometry (CCCG) Ottawa, Canada, 2007.
Triangulations with locally optimal Steiner points,
Symposium on Geometry Processing (SGP), Barcelona, Spain. 2007.
Fast Delaunay refinement algorithms.
{\em SIAM Geometric Modeling}, Phoenix, AZ, Nov 2005.
A time-optimal Delaunay refinement algorithm in two dimensions.
{\em Proc.~of the ACM Symp. on Computational Geometry (SoCG)},
Pisa, Italy, June 2005.
Quality meshes made smaller.
{\em European Workshop on Computational Geometry}, Eindhoven,
The Netherlands, March 2005.
Triangulations
Dept. of Mathematics, University of Florida , October 2005.
Practical algorithms for quality spatial and space-time discretizations
Koc University, Istanbul, Turkey, August 2005.
Practical algorithms for quality spatial and space-time discretizations
Bilkent University, Ankara, Turkey, July 2005.
A time-optimal Delaunay refinement algorithm in two dimensions.
ACM-SoCG, Pisa, Italy, June 2005.
A time-optimal Delaunay refinement algorithm in two dimensions.
Florida State University, Tallahassee, FL, May 2005.
Quality meshes made smaller.
European Workshop on Computational Geometry, Eindhoven,
The Netherlands, March 2005.
Computing quality-guaranteed triangulations:
new theoretical and practical results.
Escuela técnica superior de ingeniería
informática
Universidad de Sevilla,
Sevilla, Spain,
July 2004.
Time complexity of practical parallel Steiner point insertion algorithms
ACM-SPAA, Barcelona, Spain, June 2004.
Refinement of triangulations.
SIAM Conference on Discrete Mathematics,
Mini-symposium on Computational Geometry and Topology, Nashville, TN,
June 2004.
A new type of Steiner points for computing size-optimal
quality-guaranteed Delaunay triangulations.
Latin American Theoretical Informatics, Buenos Aires, Argentina, Apr 2004.
A new type of Steiner points for computing size-optimal
quality-guaranteed Delaunay triangulations.
University of Florida, Gainesville, FL, Dec 2003.
Mesh refinement for Jacobi curves.
NSF BioGeometry Workshop,
Duke University, Durham, NC, Nov 2003.
Approximation algorithms for degree-constrained bipartite network flow.
Int.~Symposium on Computer and Information Sciences,
Antalya, Turkey, Nov 2003.
Provably-good triangulations for protein modeling.
Carnegie Mellon University, Pittsburgh, PA, Oct 2003.
Mesh refinement: theory and practice.
University of New Mexico, Albuquerque, NM, Sep 2003.
Jacobi sets of multiple Morse functions.
NSF BioGeometry Workshop, Stanford University, Stanford, CA, June 2003.
Geometric algorithms for structural biology.
Sabanci University, Istanbul, Turkey, Dec 2002.
Geometric algorithms for structural biology.
Middle East Technical University, Ankara, Turkey, Dec 2002.
Relaxed scheduling in dynamic skin triangulation.
Japan Conference on Discrete and Computational Geometry,
Tokyo, Japan, Dec 2002.
Relaxed scheduling in dynamic skin triangulation.
DIMACS Workshop on Algorithmic Issues in Modeling Motion,
Rutgers University, Camden, NJ, Nov 2002.
Parallel Delaunay refinement: algorithms and analyses.
Duke University, Durham, NC, Oct 2002.
Tiling 3D Euclidean space with acute tetrahedra.
Canadian Conference on Computational Geometry,
University of Waterloo, Waterloo, ON, Aug 2001.
Tent-pitcher: a meshing algorithm for space-time
discontinuous Galerkin methods.
Int.~Meshing Roundtable,
New Orleans, LA, Oct 2000.
Constrained 2D space-time meshing with all tetrahedra.
IMACS World Congress
on Scientific Computation, Applied Mathematics and Simulation,
Lausanne, Switzerland, Aug 2000.
Biting spheres in 3D.
Int.~Meshing Roundtable, Lake Tahoe, CA, Oct 1999.
Adaptive mesh generation.
NSF-DARPA OPAAL Workshop, University of Iowa, Iowa City, IA, Sep 1999.
An advancing front scheme to compute good sphere packings.
NSF-DARPA OPAAL Workshop, University of Illinois, Urbana, IL, Oct 1998.
Simultaneous refinement and coarsening: adaptive meshing with moving boundary.
Int.~Meshing Roundtable, Dearborn, MI, Oct 1998.
Alper Üngör
August 2004