Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Jürgen Sellen"'
Autor:
Claus-Peter Schnorr, Hermann Walter, Volker Claus, Wolffried Stucky, Hans-Peter Blatt, Otto Spaniol, Gerd Kaufholz, Rainer Kemp, Wolfgang Paul, Eberhard Bertsch, Herbert Kopp, Manfred Stadel, Ulrich Schmitt, Wolfgang Weidner, Wolfgang Gräber, Dung Huynh, Rockford Ross, Michael Breder, Klaus Estenfeld, Axel Pink, Jan Messerschmidt, Hans Simon, Bernd Becker, Rolf Strothmann, Peter Auler, Johannes Arz, Paul Molitor, Reiner Kolla, Thomas Kretschmer, Franz Josef Schmitt, Ursula Becker, Reiner Marzinkewitsch, Hans Georg Osthof, Uwe Sparmann, Jürgen Sellen, Joachim Hartmann, Yonggang Guan, Gisela Sparmann, Hongzhong Wu, Elmar Schömer, Thomas Burch, Björn Schieffer, Christoph Scholl, Frank Follert, Thomas Chadzelek, Frank Schulz, Jens Eckstein, Matthias Buck, Bin Zhu, Alexander Gamkrelidze, Jörg Sauer, Timo von Oertzen, Tobias Gärtner, Christopher Durst
Publikováno v:
Festschrift zum 90. Geburtstag von Prof. Dr. Dr. h.c. mult. Günter Hotz ISBN: 9783658378219
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32e48b6842861657b3f0a0df274a2dcd
https://doi.org/10.1007/978-3-658-37822-6_1
https://doi.org/10.1007/978-3-658-37822-6_1
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:
International Journal of Computational Geometry & Applications. :563-580
Let S be a set of n points in ℝd, and let each point p of S have a positive weight w(p). We consider the problem of computing a ray R emanating from the origin (resp. a line l through the origin) such that min p ∈ s w(p) · d(p,R) ( resp. min p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fabe8fa9c6458ace14deb973430be9a9
https://doi.org/10.1142/s0218195997000351
https://doi.org/10.1142/s0218195997000351
Autor:
Jürgen Sellen
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 19:335-354
We investigate the topological structure of configuration spaces of kinematic scenes, i.e., mechanisms consisting of rigid, independently movable objects in a 2d or 3ddimensional environment. We demonstrate the practical importance of the considered
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d7cbca2fbc57737cfefa57b8619b748
https://doi.org/10.1023/a:1018963923924
https://doi.org/10.1023/a:1018963923924
Autor:
Jürgen Sellen
Publikováno v:
SIAM Journal on Computing. 25:1231-1253
Motion planning involving arbitrarily many degrees of freedom is known to be PSPACE-hard. In this paper, we examine the complexity of generalized motion-planning problems for planar mechanisms consisting of independently movable objects. Our construc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f15aabb6d9f4b5a9e4d0345553d6edc4
https://doi.org/10.1137/s0097539793243338
https://doi.org/10.1137/s0097539793243338
Publikováno v:
Symposium on Computational Geometry
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in time O(n 4 log O(1) n) in an algebraic complexity model. We also achie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1649d939876a762aca1268bc542e39f9
https://doi.org/10.1145/237218.237412
https://doi.org/10.1145/237218.237412
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540606925
FSTTCS
FSTTCS
Let S be a set of n points in ℝd, and let each point p of S have a positive weight w(p). We consider the problem of computing a ray R emanating from the origin (resp. a line l through the origin) such that minp∈S w(p) · d(p, R) (resp. minp∈S w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4bc4caea968db18f5dc550faa2fae02
https://doi.org/10.1007/3-540-60692-0_65
https://doi.org/10.1007/3-540-60692-0_65
Publikováno v:
Symposium on Computational Geometry
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9bee77d5c00e027cddc2b75660108cf
https://doi.org/10.1145/220279.220317
https://doi.org/10.1145/220279.220317
Publikováno v:
Symposium on Computational Geometry
Papadimitriou's approximation approach to the Euclidean shortest path (ESP) problem in 3-space is revisited. As this problem is NP-hard, his approach represents an important step towards practical algorithms. Unfortunately, there are non-trivial gaps
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80929d136720ecf5cc24bdb3276ab594
https://doi.org/10.1145/177424.177501
https://doi.org/10.1145/177424.177501
Autor:
Jürgen Sellen
Publikováno v:
Artificial Intelligence and Symbolic Mathematical Computing ISBN: 9783540573227
AISMC
AISMC
The presented work investigates the topological structure of the configuration spaces of mechanisms. We will demonstrate the practical importance of the considered questions by giving some motivations, especially from the viewpoint of qualitative rea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3120b3e5c7c7b2a1956be04dbe0797e
https://doi.org/10.1007/3-540-57322-4_3
https://doi.org/10.1007/3-540-57322-4_3