I/O-Efficient Contour Queries on Terrains
Pankaj K. Agarwal, Thomas Mølhave, and Bardia Sadri
ACM-SIAM Symposium on Discrete Mathematics (SODA), 2011 [PDF]
Read More...
ACM-SIAM Symposium on Discrete Mathematics (SODA), 2011 [PDF]
Read More...
Lipschitz Isotonic and Unimodal Regressions on Paths and Trees
Filed in: Topological Simplification | Data Structures
Pankaj K. Agarwal, Jeff Phillips, and Bardia Sadri
9th Latin American Theoretical Informatics Symposium (LATIN) 2010 [PDF]
Read More...
9th Latin American Theoretical Informatics Symposium (LATIN) 2010 [PDF]
Read More...
Manifold Homotopy via the Flow Complex
Filed in: Reconstruction
Bardia Sadri
Symposium on Geometry Processing (SGP), special issue of Computer Graphics Forum, 28(5), 2009 [PDF]
Short version in proceedings of EuroCG’08 [PDF]
EuroCG Presentation Slides [PDF]
Slides from an invited talk in the SIAM Conference on Discrete Mathematics ’08 [PDF]
Read More...
Symposium on Geometry Processing (SGP), special issue of Computer Graphics Forum, 28(5), 2009 [PDF]
Short version in proceedings of EuroCG’08 [PDF]
EuroCG Presentation Slides [PDF]
Slides from an invited talk in the SIAM Conference on Discrete Mathematics ’08 [PDF]
Read More...
Untangling Triangulations Through Local Explorations
Filed in: Geometric Algorithms | Topological Simplification
Pankaj K. Agarwal, Bardia Sadri, and Hai Yu
Symposium on Computational Geometry (SoCG), 2008 [PDF]
Read More...
Symposium on Computational Geometry (SoCG), 2008 [PDF]
Read More...
I/O-Efficient Algorithms for Computing Contour Lines on a Terrain
Lars Arge, Pankaj K. Agarwal, Thomas Mølhave, and Bardia Sadri
Symposium on Computational Geometry (SoCG), 2008 [PDF]
SoCG presentation slides [PDF]
Longer version slides [PDF]
Read More...
Symposium on Computational Geometry (SoCG), 2008 [PDF]
SoCG presentation slides [PDF]
Longer version slides [PDF]
Read More...
Geometric and Topological Guarantees for the WRAP Reconstruction Algorithm
Filed in: Reconstruction
Edgar A. Ramos and Bardia Sadri
ACM-SIAM Symposium on Discrete Mathematics (SODA), 2007 [PDF]
SODA presentation slides [PDF]
Read More...
ACM-SIAM Symposium on Discrete Mathematics (SODA), 2007 [PDF]
SODA presentation slides [PDF]
Read More...
Medial Axis Approximation and Unstable Flow Complex
Filed in: Reconstruction
Edgar A. Ramos, Joachim Giesen, and Bardia Sadri
Symposium on Computational Geometry (SoCG), 2006. [PDF]
Journal version in the SoCG’06 special issue of International Journal of Computational Geometry and Applications (IJCGA). Volume 18, Issue 6, 2009 [PDF]
SoCG presentation slides [PDF]
Read More...
Symposium on Computational Geometry (SoCG), 2006. [PDF]
Journal version in the SoCG’06 special issue of International Journal of Computational Geometry and Applications (IJCGA). Volume 18, Issue 6, 2009 [PDF]
SoCG presentation slides [PDF]
Read More...
Surface and Medial Axis Topology Through Distance Flows Induced by Discrete Samples
Filed in: Reconstruction | Theses
Bardia Sadri
PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Edgar A. Ramos, Adviser, 2006 [PDF]
PhD defense slides [PDF]
Read More...
PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Edgar A. Ramos, Adviser, 2006 [PDF]
PhD defense slides [PDF]
Read More...
Forced Orientation of Graphs
Filed in: Combinatorics
Babak Farzad, Amin Saberi, Ebad S. Mahmoodian, and Mohammad Mahdian, and Bardia Sadri
Bulletin of Iranian Mathematical Society, Vol 32, No 1, 2006. [PDF]
Read More...
Bulletin of Iranian Mathematical Society, Vol 32, No 1, 2006. [PDF]
Read More...
Critical Point of the Distance to an ε-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction
Filed in: Reconstruction
Tamal K. Dey, Joachim Giesen, Edgar A. Ramos, and Bardia Sadri
Symposium on Computational Geometry (SoCG), 2005 [PDF] Journal version in the SoCG’05 special issue of International Journal of Computational Geometry and Applications (IJCGA) (2008) 18(1/2) 29-61 [PDF]
Read More...
Symposium on Computational Geometry (SoCG), 2005 [PDF] Journal version in the SoCG’05 special issue of International Journal of Computational Geometry and Applications (IJCGA) (2008) 18(1/2) 29-61 [PDF]
Read More...
How Fast Is the k-Means Method?
Filed in: Clustering
Sariel Har-Peled and Bardia Sadri
ACM-SIAM Symposium on Discrete Mathematics (SODA), 2005 [PDF]
Journal version in Algorithmica (2005) 41:185-202 [PDF]
Read More...
ACM-SIAM Symposium on Discrete Mathematics (SODA), 2005 [PDF]
Journal version in Algorithmica (2005) 41:185-202 [PDF]
Read More...
On the Number of Steps of Lloyds k-Means Method
Filed in: Clustering | Theses
Bardia Sadri
Masters thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Sariel Har-Peled, Adviser, 2004 [PDF]
Read More...
Masters thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Sariel Har-Peled, Adviser, 2004 [PDF]
Read More...