default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBardia Sadri
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j5]Bardia Sadri, Karan Singh:
Flow-complex-based shape reconstruction from 3D curves. ACM Trans. Graph. 33(2): 20:1-20:15 (2014)- 2011
- [c8]Pankaj K. Agarwal, Thomas Mølhave, Bardia Sadri:
I/O-Efficient Contour Queries on Terrains. SODA 2011: 268-284 - 2010
- [c7]Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri:
Lipschitz Unimodal and Isotonic Regression on Paths and Trees. LATIN 2010: 384-396
2000 – 2009
- 2009
- [j4]Bardia Sadri:
Manifold Homotopy via the Flow Complex. Comput. Graph. Forum 28(5): 1361-1370 (2009) - [i1]Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri:
Lipschitz Unimodal and Isotonic Regression on Paths and Trees. CoRR abs/0912.5182 (2009) - 2008
- [j3]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. Geom. Appl. 18(1/2): 29-61 (2008) - [j2]Joachim Giesen, Edgar A. Ramos, Bardia Sadri:
Medial Axis Approximation and Unstable Flow Complex. Int. J. Comput. Geom. Appl. 18(6): 533-565 (2008) - [c6]Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri:
I/o-efficient efficient algorithms for computing contours on a terrain. SCG 2008: 129-138 - [c5]Pankaj K. Agarwal, Bardia Sadri, Hai Yu:
Untangling triangulations through local explorations. SCG 2008: 288-297 - 2007
- [c4]Edgar A. Ramos, Bardia Sadri:
Geometric and topological guarantees for the WRAP reconstruction algorithm. SODA 2007: 1086-1095 - 2006
- [b1]Bardia Sadri:
Surface and Medial Axis Topology Through Distance Flows Induced by Discrete Samples. University of Illinois Urbana-Champaign, USA, 2006 - [c3]Joachim Giesen, Edgar A. Ramos, Bardia Sadri:
Medial axis approximation and unstable flow complex. SCG 2006: 327-336 - 2005
- [j1]Sariel Har-Peled
, Bardia Sadri:
How Fast Is the k-Means Method? Algorithmica 41(3): 185-202 (2005) - [c2]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. SCG 2005: 218-227 - [c1]Sariel Har-Peled, Bardia Sadri:
How fast is the k-means method? SODA 2005: 877-885
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
