MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Ovidiu Daescu" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

11 documents found, showing 1 through 10. Next 10 →

ATOM

Maintaining Visibility of a Polygon with a Moving Point of View
by Danny Z. Chen, Ovidiu Daescu — 1996 — In Proc. 8th Canad. Conf. Comput. Geom
…Maintaining Visibility of a Polygon with a Moving Point of View Danny Z. Chen y Ovidiu Daescu…
Cited by 6 (3 self) – Add To MetaCart

Space-efficient algorithms for approximating polygonal curves in two-dimensional space
by Danny Z. Chen, Ovidiu Daescu — 1998 — Proc. 4th International Computing and Combinatorics Conf
… and Ovidiu Daescu y Department of Computer Science and Engineering University of Notre Dame Notre Dame…
Cited by 18 (4 self) – Add To MetaCart

On Geometric Path Query Problems
by Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk — 1997
… Company On Geometric Path Query Problems Danny Z. Chen Ovidiu Daescu y Kevin S. Klenk z Department…
Cited by 6 (0 self) – Add To MetaCart

Farthest-Point Queries with Geometric and Combinatorial Constraints
by Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff, Er Wolff — 2006 — Computat. Geom. Theory Appl
…Farthest-Point Queries with Geometric and Combinatorial Constraints Ovidiu Daescu ∗ Ningfang Mi…
Cited by 3 (1 self) – Add To MetaCart

Danny Z. Chen
by Danny Z. Chen, Ovidiu Daescu Yang, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
…Optimizing the Sum of Linear Fractional Functions and Applications Danny Z. Chen Ovidiu Daescu…
Add To MetaCart

Optimizing the Sum of Linear Fractional Functions and Applications
by Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
…Optimizing the Sum of Linear Fractional Functions and Applications Danny Z. Chen Ovidiu Daescu…
Cited by 2 (0 self) – Add To MetaCart

Polygonal Path Approximation with Angle Constraints
by Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink — 2001
…Polygonal Path Approximation with Angle Constraints Danny Z. Chen , Ovidiu Daescu y , John…
Cited by 1 (1 self) – Add To MetaCart

Guarding a terrain by two watchtowers
by Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Simeon Ntafos, Micha Sharir, Binhai Zhu — 2005 — In Proc. 21st Annu. ACM Sympos. Computational Geometry
…Guarding a Terrain by Two Watchtowers ∗ Pankaj K. Agarwal † Sergey Bereg ‡ Ovidiu Daescu ∗ Simeon…
Cited by 7 (1 self) – Add To MetaCart

k-link shortest paths in weighted subdivisions
by Ovidiu Daescu, Joseph S. B. Mitchell, Simeon Ntafos, James D. Palmer, Chee K. Yap — 2005 — In Proceedings of the 9th International Workshop on Algorithms and Data Structures
…k-Link Shortest Paths in Weighted Subdivisions Ovidiu Daescu1⋆ , Joseph S.B. Mitchell2⋆⋆ , Simeon…
Cited by 3 (1 self) – Add To MetaCart

Finding an optimal path without growing the tree
by Danny Z. Chen, Ovidiu Daescu, Xiaobo (sharon Hu, Jinhui Xu C — 1998 — 6th Annual European Sym. on Algorithms, Springer LNCS
… without growing the tree Danny Z. Chen, a,1 Ovidiu Daescu, b,2 Xiaobo (Sharon) Hu, a,3 and Jinhui Xu c,4 a…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB