Bardia Sadri

15 papers A* 3B 1Journal 6Unranked 4
YearRankTypeTitle / Venue / Authors
2014 J jnl
Flow-complex-based shape reconstruction from 3D curves.
ACM Trans. Graph.
Bardia Sadri, Karan Singh
2011 A* conf
I/O-Efficient Contour Queries on Terrains.
SODA
Pankaj K. Agarwal, Thomas Mølhave, Bardia Sadri
2010 B conf
Lipschitz Unimodal and Isotonic Regression on Paths and Trees.
LATIN
Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri
2009 J jnl
Lipschitz Unimodal and Isotonic Regression on Paths and Trees
CoRR
Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri
2009 J jnl
Manifold Homotopy via the Flow Complex.
Comput. Graph. Forum
Bardia Sadri
2008 J jnl
Critical Points of Distance to an epsilon-Sampling of a Surface and Flow-Complex-Based Surface Reconstruction.
Int. J. Comput. Geom. Appl.
Tamal K. Dey, Joachim Giesen, Edgar A. Ramos, Bardia Sadri
2008 — conf
I/o-efficient efficient algorithms for computing contours on a terrain.
SCG
Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri
2008 J jnl
Medial Axis Approximation and Unstable Flow Complex.
Int. J. Comput. Geom. Appl.
Joachim Giesen, Edgar A. Ramos, Bardia Sadri
2008 — conf
Untangling triangulations through local explorations.
SCG
Pankaj K. Agarwal, Bardia Sadri, Hai Yu
2007 A* conf
Geometric and topological guarantees for the WRAP reconstruction algorithm.
SODA
Edgar A. Ramos, Bardia Sadri
2006 — conf
Medial axis approximation and unstable flow complex.
SCG
Joachim Giesen, Edgar A. Ramos, Bardia Sadri
2006 — —
Surface and Medial Axis Topology Through Distance Flows Induced by Discrete Samples
Bardia Sadri
2005 — conf
Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction.
SCG
Tamal K. Dey, Joachim Giesen, Edgar A. Ramos, Bardia Sadri
2005 J jnl
How Fast Is the k-Means Method?
Algorithmica
Sariel Har-Peled, Bardia Sadri
2005 A* conf
How fast is the k-means method?
SODA
Sariel Har-Peled, Bardia Sadri