Bardia Sadri

According to our database, Bardia Sadri authored at least 11 papers between 2005 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Flow-complex-based shape reconstruction from 3D curves.

Bardia Sadri, Karan Singh

ACM Trans. Graph., 2014

2011

I/O-Efficient Contour Queries on Terrains.

Pankaj K. Agarwal, Thomas Mølhave, Bardia Sadri

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Lipschitz Unimodal and Isotonic Regression on Paths and Trees.

Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Manifold Homotopy via the Flow Complex.

Bardia Sadri

Comput. Graph. Forum, 2009

2008

Medial Axis Approximation and Unstable Flow Complex.

Joachim Giesen, Edgar A. Ramos, 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.

Tamal K. Dey, Joachim Giesen, Edgar A. Ramos, Bardia Sadri

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

Untangling triangulations through local explorations.

Pankaj K. Agarwal, Bardia Sadri, Hai Yu

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

I/o-efficient efficient algorithms for computing contours on a terrain.

Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Geometric and topological guarantees for the WRAP reconstruction algorithm.

Edgar A. Ramos, Bardia Sadri

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

2006

Surface and Medial Axis Topology Through Distance Flows Induced by Discrete Samples

Bardia Sadri

PhD thesis, 2006

2005

How Fast Is the k-Means Method?

Sariel Har-Peled, Bardia Sadri

Algorithmica, 2005