Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Jiongxin Jin"'
Publikováno v:
International Journal of Computational Geometry & Applications. 27:13-32
We propose an algorithm for finding a [Formula: see text]-approximate shortest path through a weighted 3D simplicial complex [Formula: see text]. The weights are integers from the range [Formula: see text] and the vertices have integral coordinates.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f66a5daacdc2e5a4b3c946d1bf79b26
https://doi.org/10.1142/s0218195917600020
https://doi.org/10.1142/s0218195917600020
Autor:
Siu-Wing Cheng, Jiongxin Jin
Publikováno v:
Discrete & Computational Geometry. 54:110-151
Little theoretical work has been done on edge flips in surface meshes despite their popular usage in graphics and solid modeling to improve mesh equality. We propose the class of $$(\varepsilon ,\alpha )$$(?,?)-meshes of a surface that satisfy severa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2eaf29e1a1a5d42b6efd4f4644ed4f5a
https://doi.org/10.1007/s00454-015-9693-y
https://doi.org/10.1007/s00454-015-9693-y
Autor:
Siu-Wing Cheng, Jiongxin Jin
Publikováno v:
SIAM Journal on Computing. 43:410-428
We present an approximation algorithm for the shortest descending path problem. Given a source $s$ and a destination $t$ on a terrain, a shortest descending path from $s$ to $t$ is a path of minimum Euclidean length on the terrain subject to the cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e57edb2d16c30cd86cf0e168a686cde3
https://doi.org/10.1137/130913808
https://doi.org/10.1137/130913808
Publikováno v:
International Journal of Computational Geometry & Applications. 22:83-102
A path P between two points s and t in a polygonal subdivision [Formula: see text] with obstacles and weighted regions defines a class of paths that can be deformed to P without passing over any obstacle. We present the first algorithm that, given P
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c530eb74008e31a7a6cd1d5ead9360b0
https://doi.org/10.1142/s0218195912600059
https://doi.org/10.1142/s0218195912600059
Publikováno v:
Algorithms and Computation ISBN: 9783662489703
ISAAC
ISAAC
We propose an algorithm for finding a \((1+\varepsilon )\)-approximate shortest path through a weighted 3D simplicial complex \(\mathcal T\). The weights are integers from the range [1, W] and the vertices have integral coordinates. Let N be the larg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::143e7011f2a6c65cab413a4f5b2c5290
https://doi.org/10.1007/978-3-662-48971-0_4
https://doi.org/10.1007/978-3-662-48971-0_4
Publikováno v:
Scopus-Elsevier
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1064eec8b33ad5ef2a52a54376a37b95
https://doi.org/10.1137/1.9781611973730.108
https://doi.org/10.1137/1.9781611973730.108
Autor:
Jiongxin Jin, Siu-Wing Cheng
Publikováno v:
STOC
We present an algorithm for computing shortest paths on polyhedral surfaces under convex distance functions. Let n be the total number of vertices, edges and faces of the surface. Our algorithm can be used to compute L1 and L∞ shortest paths on a p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::499cf27db3c99af2e45792b1b38bee90
https://doi.org/10.1145/2591796.2591821
https://doi.org/10.1145/2591796.2591821
Publikováno v:
Symposium on Computational Geometry
We present an algorithm for surface reconstruction from a point cloud. It runs in O ( n log n ) time, where n is the number of sample points, and this is optimal in the pointer machine model. The only existing O ( n log n )-time algorithm is due to F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96f4b442b0e389ac5bcec815a2356e32
https://doi.org/10.1145/2261250.2261260
https://doi.org/10.1145/2261250.2261260
Autor:
Jiongxin Jin, Siu-Wing Cheng
Publikováno v:
Symposium on Computational Geometry
We study edge flips in a surface mesh and the maintenance of a deforming surface mesh. If the vertices are dense with respect to the local feature size and the triangles have angles at least a constant, we can flip edges in linear time such that all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55ff88eb71e1150d2f155d082ef8edbe
https://doi.org/10.1145/1998196.1998253
https://doi.org/10.1145/1998196.1998253