Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Chee-Keng Yap"'
Publikováno v:
Journal of Symbolic Computation. 86:51-96
We describe a subdivision algorithm for isolating the complex roots of a polynomial F ∈ C [ x ] . Given an oracle that provides approximations of each of the coefficients of F to any absolute error bound and given an arbitrary square B in the compl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62316a14318c9a158ef3f22ba96ca31e
https://doi.org/10.1016/j.jsc.2017.03.009
https://doi.org/10.1016/j.jsc.2017.03.009
Autor:
Jacob T. Schwartz, Chee-Keng Yap
First published in 1987, the seven chapters that comprise this book review contemporary work on the geometric side of robotics. The first chapter defines the fundamental goal of robotics in very broad terms and outlines a research agenda each of whos
Autor:
Chee-Keng Yap
Publikováno v:
Algorithmic and Geometric Aspects of Robotics (Routledge Revivals) ISBN: 9781315471457
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5112630ffd353ee60d342e595e65e972
https://doi.org/10.4324/9781315471457-9
https://doi.org/10.4324/9781315471457-9
Publikováno v:
Springer Tracts in Advanced Robotics ISBN: 9783319165943
WAFR
WAFR
Motion planning is a major topic in robotics . Divergent paths have been taken by practical roboticists and theoretical motion planners. Our goal is to produce algorithms that are practical and have strong theoretical guarantees. Recently, we have pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::238d56b6ff3d2ed66cca39dc634e6721
https://doi.org/10.1007/978-3-319-16595-0_21
https://doi.org/10.1007/978-3-319-16595-0_21
Autor:
Chee-Keng Yap
Publikováno v:
Frontiers in Algorithmics ISBN: 9783319196466
FAW
FAW
We propose to design motion planning algorithms with a strong form of resolution completeness, called resolution-exactness. Such planners can be implemented using soft predicates within the subdivision paradigm. The advantage of softness is that we a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fef2fdcbe1e64a97dd6aa2c9f1b253e4
https://doi.org/10.1007/978-3-319-19647-3_2
https://doi.org/10.1007/978-3-319-19647-3_2
Publikováno v:
Journal of Logic and Algebraic Programming
Journal of Logic and Algebraic Programming, Elsevier, 2005, Practical development of exact real number computation, 64 (1), pp.85-111. ⟨10.1016/j.jlap.2004.07.006⟩
Journal of Logic and Algebraic Programming, 2005, Practical development of exact real number computation, 64 (1), pp.85-111. ⟨10.1016/j.jlap.2004.07.006⟩
Journal of Logic and Algebraic Programming, Elsevier, 2005, Practical development of exact real number computation, 64 (1), pp.85-111. ⟨10.1016/j.jlap.2004.07.006⟩
Journal of Logic and Algebraic Programming, 2005, Practical development of exact real number computation, 64 (1), pp.85-111. ⟨10.1016/j.jlap.2004.07.006⟩
International audience; Computational geometry has produced an impressive wealth of efficient algorithms. The robust implementation of these algorithms remains a major issue. Among the many proposed approaches for solving numerical non-robustness, ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::744d10962a361bb832f509d8b7e97328
Autor:
Chee-Keng Yap, Ee-Chien Chang
Publikováno v:
Algorithmica. 26:255-262
We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x,y ∈ [0,1] with as little uncertainty as possible, using some given number k of probes. Each probe is sp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35a1b721d49051e7584af52f364863f4
https://doi.org/10.1007/s004539910012
https://doi.org/10.1007/s004539910012
Publikováno v:
SIAM Journal on Computing. 29:1577-1595
This paper introduces the concept of precision-sensitive algorithms, analogous to the well-known output-sensitive algorithms. We exploit this idea in studying the complexity of the 3-dimensional Euclidean shortest path problem. Specifically, we analy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90be96c06266bdeaac777e23fd42d4d5
https://doi.org/10.1137/s0097539798340205
https://doi.org/10.1137/s0097539798340205
Publikováno v:
Discrete & Computational Geometry. 18:433-454
In this paper, we give an algorithm for output-sensitive construction of an f-face convex hull of a set of n points in general position in E 4 . Our algorithm runs in \(O((n+f)\log^2 f)\) time and uses O(n+f) space. This is the first algorithm within
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2191b6184716a35cdd6ec463608b66d4
https://doi.org/10.1007/pl00009327
https://doi.org/10.1007/pl00009327