dblp.uni-trier.dewww.uni-trier.de

Bardia Sadri

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
9EEPankaj 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
8EEPankaj K. Agarwal, Bardia Sadri, Hai Yu: Untangling triangulations through local explorations. Symposium on Computational Geometry 2008: 288-297
7EETamal 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)
6EEJoachim Giesen, Edgar A. Ramos, Bardia Sadri: Medial Axis Approximation and Unstable Flow Complex. Int. J. Comput. Geometry Appl. 18(6): 533-565 (2008)
2007
5EEEdgar A. Ramos, Bardia Sadri: Geometric and topological guarantees for the WRAP reconstruction algorithm. SODA 2007: 1086-1095
2006
4EEJoachim Giesen, Edgar A. Ramos, Bardia Sadri: Medial axis approximation and unstable flow complex. Symposium on Computational Geometry 2006: 327-336
2005
3EESariel Har-Peled, Bardia Sadri: How fast is the k-means method? SODA 2005: 877-885
2EETamal 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
1EESariel Har-Peled, Bardia Sadri: How Fast Is the k-Means Method? Algorithmica 41(3): 185-202 (2005)

Coauthor Index

1Pankaj K. Agarwal [8] [9]
2Lars Arge [9]
3Tamal K. Dey [2] [7]
4Joachim Giesen [2] [4] [6] [7]
5Sariel Har-Peled [1] [3]
6Thomas Mølhave [9]
7Edgar A. Ramos [2] [4] [5] [6] [7]
8Hai Yu [8]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)