Ovidiu Daescu

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
33Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data. Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu. COCOON 2011, 192-203. Web SearchBibTeXDownload
2010
32Guarding a Terrain by Two Watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu. Algorithmica (58): 352-390 (2010). Web SearchBibTeXDownload
31NP-Completeness of Spreading Colored Points. Ovidiu Daescu, Wenqi Ju, Jun Luo. COCOA (1) 2010, 41-50. Web SearchBibTeXDownload
30Visiting a Sequence of Points with a Bevel-Tip Needle. Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk. LATIN 2010, 492-502. Web SearchBibTeXDownload
2009
29Stabbing balls and simplifying proteins. Ovidiu Daescu, Jun Luo. IJBRA (5): 64-80 (2009). Web SearchBibTeXDownload
2007
28Computing Simple Paths on Points in Simple Polygons. Ovidiu Daescu, Jun Luo. KyotoCGGT 2007, 41-55. Web SearchBibTeXDownload
2006
27Proximity problems on line segments spanned by points. Ovidiu Daescu, Jun Luo, David M. Mount. Comput. Geom. (33): 115-129 (2006). Web SearchBibTeXDownload
26Cutting out Polygons with Lines and Rays. Ovidiu Daescu, Jun Luo. Int. J. Comput. Geometry Appl. (16): 227-248 (2006). Web SearchBibTeXDownload
25Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. Symposium on Computational Geometry 2006, 483-484. Web SearchBibTeXDownload
24An Experimental Study of Weighted k-Link Shortest Path Algorithms. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. WAFR 2006, 187-202. Web SearchBibTeXDownload
2005
23Proximity Problems on Line Segments Spanned by Points. Ovidiu Daescu, Jun Luo, David M. Mount. CCCG 2005, 227-231. Web SearchBibTeXDownload
22Cutting Out Polygons. Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo. CCCG 2005, 183-186. Web SearchBibTeXDownload
21Polygonal path simplification with angle constraints. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink. Comput. Geom. (32): 173-187 (2005). Web SearchBibTeXDownload
20Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications. Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu. J. Comb. Optim. (9): 69-90 (2005). Web SearchBibTeXDownload
19Flexible Strategies for Disk Scheduling in Multimedia Presentation Servers. S. Emilda, L. Jacob, Ovidiu Daescu, B. Prabhakaran. Multimedia Tools Appl. (26): 81-99 (2005). Web SearchBibTeXDownload
18Guarding a terrain by two watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu. Symposium on Computational Geometry 2005, 346-355. Web SearchBibTeXDownload
17k-Link Shortest Paths in Weighted Subdivisions. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. WADS 2005, 325-337. Web SearchBibTeXDownload
2004
16Cutting Out Polygons with Lines and Rays. Ovidiu Daescu, Jun Luo. ISAAC 2004, 669-680. Web SearchBibTeXDownload
2003
15Efficient Parallel Algorithms for Planar st-Graphs. Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu. Algorithmica (35): 194-215 (2003). Web SearchBibTeXDownload
14Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space. Danny Z. Chen, Ovidiu Daescu. Int. J. Comput. Geometry Appl. (13): 95-111 (2003). Web SearchBibTeXDownload
13Finding an optimal path without growing the tree. Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu. J. Algorithms (49): 13-41 (2003). Web SearchBibTeXDownload
2002
12Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Gill Barequet, Michael T. Goodrich, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink. Algorithmica (33): 150-167 (2002). Web SearchBibTeXDownload
11Flexible disk scheduling for multimedia presentation servers. S. Emilda, L. Jacob, Ovidiu Daescu, B. Prabhakaran. IEEE Workshop on Multimedia Signal Processing 2002, 452-455. Web SearchBibTeX
2001
10On Geometric Path Query Problems. Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk. Int. J. Comput. Geometry Appl. (11): 617-645 (2001). Web SearchBibTeX
9Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu. J. Comb. Optim. (5): 59-79 (2001). Web SearchBibTeXDownload
8Polygonal path approximation with angle constraints. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink. SODA 2001, 342-343. Web SearchBibTeXDownload
2000
7Optimizing the sum of linear fractional functions and applications. Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu. SODA 2000, 707-716. Web SearchBibTeXDownload
1999
6Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu. Symposium on Computational Geometry 1999, 322-331. Web SearchBibTeXDownload
1998
5Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. Danny Z. Chen, Ovidiu Daescu. COCOON 1998, 45-54. Web SearchBibTeXDownload
4Finding an Optimal Path without Growing the Tree. Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu. ESA 1998, 356-367. Web SearchBibTeXDownload
3Maintaining Visibility of a Polygon with a Moving Point of View. Danny Z. Chen, Ovidiu Daescu. Inf. Process. Lett. (65): 269-275 (1998). Web SearchBibTeXDownload
1997
2On Geometric Path Query Problems. Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk. WADS 1997, 248-257. Web SearchBibTeXDownload
1996
1Maintaining Visibility of a Polygon with a Moving Point of View. Danny Z. Chen, Ovidiu Daescu. CCCG 1996, 240-245. Web SearchBibTeX
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research