Edgar A. Ramos

CoRR, 2020

2013

Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions.

[BibT_eX]

[DOI]

Comput. Geom., 2013

2010

Well-Centered Triangulation.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2010

Delaunay Refinement for Piecewise Smooth Complexes.

[BibT_eX]

[DOI]

Siu-Wing Cheng

Tamal K. Dey

Discret. Comput. Geom., 2010

2009

Isotopic Reconstruction of Surfaces with Boundaries.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2009

MLS-based scalar fields over triangle meshes and their application in mesh processing.

[BibT_eX]

[DOI]

Jingyi Jin

Michael Garland

Proceedings of the 2009 Symposium on Interactive 3D Graphics, 2009

2008

TSP-Based Curve Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Medial Axis Approximation and Unstable Flow Complex.

[BibT_eX]

[DOI]

Joachim Giesen

Bardia Sadri

Int. J. Comput. Geom. Appl., 2008

Critical Points of Distance to an epsilon-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2008

2007

Sampling and Meshing a Surface with Guaranteed Topology and Geometry.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Geometric and topological guarantees for the WRAP reconstruction algorithm.

[BibT_eX]

[DOI]

Bardia Sadri

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Well-centered Planar Triangulation - An Iterative Approach.

[BibT_eX]

[DOI]

Proceedings of the 16th International Meshing Roundtable, 2007

2006

Anisotropic surface meshing.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Approximating <i>k</i>-hop minimum-spanning trees.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

Quality Meshing of Polyhedra with Small Angles.

[BibT_eX]

[DOI]

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

Curve reconstruction from noisy samples.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Manifold reconstruction from point samples.

[BibT_eX]

[DOI]

Siu-Wing Cheng

Tamal K. Dey

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2002

Smooth-surface reconstruction in near-linear time.

[BibT_eX]

[DOI]

Stefan Funke

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2001

An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Solving Some Discrepancy Problems in NC.

[BibT_eX]

[DOI]

Sanjeev Mahajan

K. V. Subrahmanyam

Algorithmica, 2001

Reconstructing a collection of curves with corners and endpoints.

[BibT_eX]

[DOI]

Stefan Funke

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Curve reconstruction: Connecting dots with good reason.

[BibT_eX]

[DOI]

Tamal K. Dey

Kurt Mehlhorn

Comput. Geom., 2000

Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Deterministic algorithms for 3-D diameter and some 2-D lower envelopes.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Linear programming queries revisited.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Linear-time triangulation of a simple polygon made easier via randomization.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

On Range Reporting, Ray Shooting and <i>k</i>-Level Construction.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Improved Deterministic Parallel Padded Sorting.

[BibT_eX]

[DOI]

Ka Wong Chong

Proceedings of the Algorithms, 1998

I/O-optimal computation of segment intersections.

[BibT_eX]

[DOI]

Proceedings of the External Memory Algorithms, 1998

Randomized External-Memory Algorithms for Some Geometric Problems.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1997

Inclusion - Exclusion Complexes for Pseudodisk Collections.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

Discret. Comput. Geom., 1997

Intersection of Unit-balls and Diameter of a Point Set in 3.

[BibT_eX]

[DOI]

Comput. Geom., 1997

Efficient Approximation and Optimization Algorithms for Computational Metrology.

[BibT_eX]

[DOI]

Christian A. Duncan

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Construction of 1-d Lower Envelopes and Applications.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Equipartition of Mass Distributions by Hyperplanes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1996

The Number of Extreme Triples of a Planar Point Set.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1996

On Computing Voronoi Diagrams by Divide-Prune-and-Conquer.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Computing faces in segment and simplex arrangements (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

Parallel Algorithms for Higher-Dimensional Convex Hulls

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1992

Optimal Distribution of Signatures in Signature Hashing.

[BibT_eX]

[DOI]

M. V. Ramakrishna