 | 2009 |
|---|
| 10 |       | Bardia Sadri:
Manifold Homotopy via the Flow Complex.
Comput. Graph. Forum 28(5): 1361-1370 (2009) |
| 2008 |
|---|
| 9 | | Pankaj K. Agarwal,
Lars Arge,
Thomas Mølhave,
Bardia Sadri:
I/o-efficient efficient algorithms for computing contours on a terrain.
Symposium on Computational Geometry 2008: 129-138 |
| 8 | | Pankaj K. Agarwal,
Bardia Sadri,
Hai Yu:
Untangling triangulations through local explorations.
Symposium on Computational Geometry 2008: 288-297 |
| 7 | | Tamal K. Dey,
Joachim Giesen,
Edgar A. Ramos,
Bardia Sadri:
Critical Points of Distance to an epsilon-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction.
Int. J. Comput. Geometry Appl. 18(1/2): 29-61 (2008) |
| 6 | | Joachim Giesen,
Edgar A. Ramos,
Bardia Sadri:
Medial Axis Approximation and Unstable Flow Complex.
Int. J. Comput. Geometry Appl. 18(6): 533-565 (2008) |
| 2007 |
|---|
| 5 | | Edgar A. Ramos,
Bardia Sadri:
Geometric and topological guarantees for the WRAP reconstruction algorithm.
SODA 2007: 1086-1095 |
| 2006 |
|---|
| 4 | | Joachim Giesen,
Edgar A. Ramos,
Bardia Sadri:
Medial axis approximation and unstable flow complex.
Symposium on Computational Geometry 2006: 327-336 |
| 2005 |
|---|
| 3 | | Sariel Har-Peled,
Bardia Sadri:
How fast is the k-means method?
SODA 2005: 877-885 |
| 2 | | Tamal K. Dey,
Joachim Giesen,
Edgar A. Ramos,
Bardia Sadri:
Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction.
Symposium on Computational Geometry 2005: 218-227 |
| 1 | | Sariel Har-Peled,
Bardia Sadri:
How Fast Is the k-Means Method?
Algorithmica 41(3): 185-202 (2005) |
