Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Victor Milenkovic"'
Autor:
Adam Mcmahon, Victor Milenkovic
Publikováno v:
Journal of Systemics, Cybernetics and Informatics, Vol 9, Iss 4, Pp 34-38 (2011)
While both volunteer computing and social networks have proved successful, the merging of these two models is a new field: Social Volunteer Computing. A Social Volunteer Computing system utilizes the relationships within a social network to determine
Externí odkaz:
https://doaj.org/article/d6548761e6984d87b301631e256573b8
Autor:
Victor Milenkovic, Elisha Sacks
Publikováno v:
International Journal of Computational Geometry & Applications. 32:39-54
Computational geometry algorithms branch on the signs of predicates. Prior predicate evaluation techniques are slow on degenerate (zero sign) predicates, especially on predicates on algebraic numbers. Degeneracy is common for predicates whose argumen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e86f88d71bd65af6aaee4a5223612b7
https://doi.org/10.1142/s0218195922500054
https://doi.org/10.1142/s0218195922500054
Publikováno v:
International Journal of Computational Geometry & Applications. 29:219-237
An implementation of a computational geometry algorithm is robust if the combinatorial output is correct for every input. Robustness is achieved by ensuring that the predicates in the algorithm are evaluated correctly. A predicate is the sign of an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::909b04b60849b6504add37403a2e699c
https://doi.org/10.1142/s0218195919500067
https://doi.org/10.1142/s0218195919500067
Publikováno v:
Computer-Aided Design. 90:18-26
We present a free space construction algorithm for a polyhedron that translates in the x y plane and rotates around its z axis, relative to a stationary polyhedron. We employ the proven paradigm of constructing the configuration space subdivision def
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ad82116db9aaeefc2d7c44f6ede33d4
https://doi.org/10.1016/j.cad.2017.05.017
https://doi.org/10.1016/j.cad.2017.05.017
Autor:
Elisha Sacks, Victor Milenkovic
Geometric rounding of a mesh is the task of approximating its vertex coordinates by floating point numbers while preserving mesh structure. Geometric rounding allows algorithms of computational geometry to interface with numerical algorithms. We pres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::253b167d7ff732e708c9b687bd7c8383
http://arxiv.org/abs/1805.03252
http://arxiv.org/abs/1805.03252
Autor:
Elisha Sacks, Victor Milenkovic
Publikováno v:
Computer-Aided Design. 46:216-220
We present a geometric rounding algorithm for robustly implementing cascaded operations on polyhedra where the output of each operation is an input to the next operation. The rounding algorithm reduces the bit-precision of the input and eliminates de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18496411a44ec423d0801f331e5b8036
https://doi.org/10.1016/j.cad.2013.08.035
https://doi.org/10.1016/j.cad.2013.08.035
Publikováno v:
IEEE Transactions on Automation Science and Engineering. 10:875-883
We present a free space computation algorithm for two planar bodies bounded by line segments and circular arcs. The computational complexity is O(((mn)2+k)log(mn)) with m and n the number of boundary curves of the two bodies, and with k the number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db72c78ab4db27c142d629ab03d34dbb
https://doi.org/10.1109/tase.2013.2277781
https://doi.org/10.1109/tase.2013.2277781
Publikováno v:
International Journal of Computational Geometry & Applications. 23:1-27
We present robust algorithms for set operations and Euclidean transformations of curved shapes in the plane using approximate geometric primitives. We use a refinement algorithm to ensure consistency. Its computational complexity is $\bigo(n\log n+k)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac1b37c41d764c147facb561056d2824
https://doi.org/10.1142/s0218195913500015
https://doi.org/10.1142/s0218195913500015
Publikováno v:
Department of Computer Science Faculty Publications
We present an algorithmic solution to the robustness problem in computational geometry, called controlled linear perturbation, and demonstrate it on Minkowski sums of polyhedra. The robustness problem is how to implement real RAM algorithms accuratel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::580ae078b5f45497f73c1b97a047c380
https://doi.org/10.1016/j.cad.2011.06.015
https://doi.org/10.1016/j.cad.2011.06.015
Autor:
Elisha Sacks, Victor Milenkovic
Publikováno v:
International Journal of Computational Geometry & Applications. 20:485-509
We present two approximate Minkowski sum algorithms for planar regions bounded by line and circle segments. Both algorithms form a convolution curve, construct its arrangement, and use winding numbers to identify sum cells. The first uses the kinetic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6781228613c7d9b527c0f49517b60629
https://doi.org/10.1142/s0218195910003402
https://doi.org/10.1142/s0218195910003402