Filters








833 Hits in 3.4 sec

Shortest Paths in a Cuboidal World [chapter]

Fajie Li, Reinhard Klette
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
However, if the 3D world is subdivided into cubes, all of the same size, defining obstacles or possible spaces to move in, then the Euclidean shortest path problem has a linear-time solution, if all spaces  ...  The shortest path through a simple cube-curve in the orthogonal 3D grid is a minimum-length polygonal curve (MLP for short).  ...  If a cuboidal world can be assumed then this paper provides two general and linear-time shortest path algorithms. 3D MLP calculations generalize MLP computations in 2D; see, for example, [8, 17] for  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11774938_33">doi:10.1007/11774938_33</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/klahkozvjjgwhdknju4wxw6irm">fatcat:klahkozvjjgwhdknju4wxw6irm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170923062810/https://researchspace.auckland.ac.nz/bitstream/handle/2292/2794/CITR-TR-176.pdf?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/38/6f/386f870832f7b77924af59685d5f98297c9deb94.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11774938_33"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A multi-objective route planning model based on genetic algorithm for cuboid surfaces

Gonca Ozmen Koca, Sengul Dogan, Hicran Yilmaz
<span title="2018-01-02">2018</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7yiv273fejbe7nrhi2haqan7oq" style="color: black;">Automatika</a> </i> &nbsp;
To cite this article: Gonca Ozmen Koca, Sengul Dogan & Hicran Yilmaz (2018) A multi-objective route planning model based on genetic algorithm for cuboid surfaces, ABSTRACT During a natural disaster, risk  ...  In this study, a system is proposed for evacuating people from building with the shortest/safest route, taking into account certain factors to evaluate the current situation of the fire.  ...  If no ⎧ ⎨ ⎩ find the shortest route using TSP with green exit select the path taking into account of lpc ⎫ ⎬ ⎭ Step G2_5: May one reach a collection point?  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/00051144.2018.1498205">doi:10.1080/00051144.2018.1498205</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3t4jgw7dcbcahgtkt3cq4b2o2m">fatcat:3t4jgw7dcbcahgtkt3cq4b2o2m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200306130334/https://hrcak.srce.hr/file/328224" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ca/59/ca59c09ac618c3376da08db74353b9549647c1dd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/00051144.2018.1498205"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> tandfonline.com </button> </a>

Application of Ant Colony Optimization for the Solution of 3 Dimensional Cuboid Structures

Hüseyin Eldem, Erkan Ülker
<span title="">2014</span> <i title="Scientific Research Publishing, Inc,"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3knnadznr5bfriv5arevcxfm7m" style="color: black;">Journal of Computer and Communications</a> </i> &nbsp;
Traveling Salesman Problem (TSP) is one of the most widely studied real world problems of finding the shortest (minimum cost) possible route that visits each node in a given set of nodes (cities) once  ...  In this study, ant colony optimization, one of meta-heuristic methods, is applied to solve Euclidian TSP consisting of nine different sized sets of nodes randomly placed on a cuboid surface.  ...  Four possible routes must be calculated for measuring the distance between opposite faces and the shortest path must be chosen.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4236/jcc.2014.24014">doi:10.4236/jcc.2014.24014</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dhp5ir33kvd2lniycjsg5rtq64">fatcat:dhp5ir33kvd2lniycjsg5rtq64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140901165518/http://www.scirp.org/journal/PaperDownload.aspx?paperID=43866" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/00/c6/00c6d4a617ba28487c027ea6f5e924594d49f43c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4236/jcc.2014.24014"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Efficient Topological OLAP on Information Networks [chapter]

Qiang Qu, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, Hongyan Li
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We propose a framework for efficient OLAP on information networks with a focus on the most interesting kind, the topological OLAP (called "T-OLAP"), which incurs topological changes in the underlying networks  ...  We also provide a T-OLAP query processing framework into which these techniques are weaved.  ...  In fact, shortest-path algorithms typically rely on the property that a shortest path between two vertices contains other shortest paths within it.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-20149-3_29">doi:10.1007/978-3-642-20149-3_29</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qpjzsw5xn5cjvcsne5nsbcjuri">fatcat:qpjzsw5xn5cjvcsne5nsbcjuri</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829004858/http://www.mysmu.edu/faculty/fdzhu/paper/DASFAA&#39;11.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/33/8d/338d21337e26cc1c4d416982c3fdb04af1d9353c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-20149-3_29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Bendable Cuboid Robot Path Planning with Collision Avoidance using Generalized L_p Norms [article]

Nak-seung P. Hyun and Patricio A. Vela and Erik I. Verriest
<span title="2017-12-16">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
For bendable cuboid robots a weighted L_p norm in polar coordinates implicitly approximates the surface boundary through a specified level set.  ...  Optimal path planning problems for rigid and deformable (bendable) cuboid robots are considered by providing an analytic safety constraint using generalized L_p norms.  ...  In the rigid regular cuboid model, the cost function is chosen, L(g,ġ, u) := ẋ 2 +ẏ 2 +ż 2 , to give a shortest path problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1712.06021v1">arXiv:1712.06021v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yzbe7rvv2vbtto6nnp5ql2uwcq">fatcat:yzbe7rvv2vbtto6nnp5ql2uwcq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200827135733/https://arxiv.org/pdf/1712.06021v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d8/be/d8be2a89391533a33a3182fdaf4de99d8848937d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1712.06021v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Query-based Graph Cuboid Outlier Detection

Ayushi Dalmia, Manish Gupta, Vasudeva Varma
<span title="">2015</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s2uqofedx5gzlnmioe3yqc522e" style="color: black;">Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015 - ASONAM &#39;15</a> </i> &nbsp;
Further we perform this detection in a query sensitive way. Given a general subgraph query on a heterogeneous network, we study the problem of finding outlier cuboids from the graph OLAP lattice.  ...  A Graph Cuboid Outlier (GCOutlier) is a cuboid with exceptionally high density of matches for the query.  ...  For a given distance D, a breadth-first traversal from v upto a distance D is required in order to obtain the shortest path information in the D-hop neighborhood subgraph of v.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2808797.2810061">doi:10.1145/2808797.2810061</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/asunam/DalmiaGV15.html">dblp:conf/asunam/DalmiaGV15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/obmbgrc4vng5jnbmjn2lh6vtdu">fatcat:obmbgrc4vng5jnbmjn2lh6vtdu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150924001835/http://research.microsoft.com/pubs/251864/dalmia15_asonam.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b3/d5/b3d5610f3fa896aba8c4b28b83335adb51a97fda.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2808797.2810061"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Fast Ray-tracing Method for Locating Mining-Induced Seismicity by Considering Underground Voids

Pingan Peng, Yuanjian Jiang, Liguan Wang, Zhengxiang He, Siyu Tu
<span title="2020-09-27">2020</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/smrngspzhzce7dy6ofycrfxbim" style="color: black;">Applied Sciences</a> </i> &nbsp;
In this paper, to improve the microseismicity location accuracy in mines, we present a fast ray-tracing method to calculate the ray path and travel time from source to receiver considering underground  ...  Finally, the set of adjacent nodes of each node is calculated, and then we obtain the shortest travel time from the source to the receiver based on the Dijkstra algorithm.  ...  Schematic diagram of calculating the shortest path. 15 Figure 6 . 156 Figure 6. Schematic diagram of calculating the shortest path. We first established a void model, as shown in Figure7.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/app10196763">doi:10.3390/app10196763</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/supwp5gcdjgmxnkhzaj426foq4">fatcat:supwp5gcdjgmxnkhzaj426foq4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200929090637/https://res.mdpi.com/d_attachment/applsci/applsci-10-06763/article_deploy/applsci-10-06763.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/63/f2/63f2763f874c4ad8b928aae698713d385fc95df2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/app10196763"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

PATH PLANNING FOR VISUAL SERVOING AND NAVIGATION USING CONVEX OPTIMIZATION

Abdul Hafez Abdul Hafez, Anil K. Nelakanti, C.V. Jawahar
<span title="">2015</span> <i title="ACTA Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7r4lhfkd7ngbjdxyei65uj6rtu" style="color: black;">International Journal of Robotics and Automation</a> </i> &nbsp;
We demonstrate the performance of the algorithm by generating control signals in a simulated framework for visual servoing and in a real-world for robot navigation.  ...  We perform a constrained optimization on the error in a convex domain considering all the necessary constraints using convex optimization techniques and further extend it to nonconvex domains.  ...  The shortest possible path would obviously be a straight line path L S = {X S i = (t S i r S i ) | i = 1, . . . , C − 1} between the two poses.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2316/journal.206.2015.3.206-4271">doi:10.2316/journal.206.2015.3.206-4271</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bmnox5f6bvbgtehhzrq5yxc7tu">fatcat:bmnox5f6bvbgtehhzrq5yxc7tu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224180728/http://pdfs.semanticscholar.org/5930/eb53e679e5108bf32fd95ff91c7a4450292f.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/59/30/5930eb53e679e5108bf32fd95ff91c7a4450292f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2316/journal.206.2015.3.206-4271"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Complex Robotic Manipulation via Graph-Based Hindsight Goal Generation [article]

Zhenshan Bing and Matthias Brucker and Fabrice O. Morin and Kai Huang and Alois Knoll
<span title="2020-07-27">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we propose graph-based hindsight goal generation (G-HGG), an extension of HGG selecting hindsight goals based on shortest distances in an obstacle-avoiding graph, which is a discrete representation  ...  HGG enhances HER by selecting intermediate goals that are easy to achieve in the short term and promising to lead to target goals in the long term.  ...  Then, a suitable shortest-path based distance measure similar to the ones in Figures 1c and 1d is required in such a scenario.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.13486v1">arXiv:2007.13486v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vx7p5rt7dfglvkc5ru7c7ptucy">fatcat:vx7p5rt7dfglvkc5ru7c7ptucy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200809024928/https://arxiv.org/pdf/2007.13486v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.13486v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A Quaternion-Based Piecewise 3D Modeling Method for Indoor Path Networks

Hongdeng Jian, Xiangtao Fan, Jian Liu, Qingwen Jin, Xujie Kang
<span title="2019-02-15">2019</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fw2uac7a5jggbfgqwh2wqy7yxu" style="color: black;">ISPRS International Journal of Geo-Information</a> </i> &nbsp;
A quaternion-based method is devised to calculate the coordinates of the designed elements, and a piecewise 3D modeling method is implemented to create the entire 3D indoor path models in a 3D GIS scene  ...  In this paper, a quaternion-based piecewise 3D modeling method is proposed to automatically generate highly recognizable 3D models for indoor path networks.  ...  The result of path analysis is a table that contains the sequence ids of nodes and edges in the shortest path.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/ijgi8020089">doi:10.3390/ijgi8020089</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v5vugnnsbngi3cagvkyc3sbxba">fatcat:v5vugnnsbngi3cagvkyc3sbxba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190503204709/https://res.mdpi.com/ijgi/ijgi-08-00089/article_deploy/ijgi-08-00089.pdf?filename=&amp;attachment=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d3/d7/d3d77f2308953b01ed5b66a61f5b40435daa79f8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/ijgi8020089"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Global Uncertainty-based Selection of Relative Poses for Multi Camera Calibration

F. Bajramovic, J. Denzler
<span title="">2008</span> <i title="British Machine Vision Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6bfo5625nvdfvbgyf7ldi5wmfe" style="color: black;">Procedings of the British Machine Vision Conference 2008</a> </i> &nbsp;
We show that our criterion is equivalent to computing a shortest subgraph consisting of shortest triangle connected paths and provide an efficient algorithm.  ...  Extrinsically calibrating a multi camera system from scene images is in general a very difficult problem. One promising approach uses pairwise relative poses as input.  ...  The graph is defined such that a shortest path from an entry vertex to an exit vertex corresponds to a shortest triangle connected path in G R with fixed first edge.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5244/c.22.74">doi:10.5244/c.22.74</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/bmvc/BajramovicD08.html">dblp:conf/bmvc/BajramovicD08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/npu2cnxub5cu7iu52frphfv67e">fatcat:npu2cnxub5cu7iu52frphfv67e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809114913/http://hera.inf-cv.uni-jena.de:6680/pdf/Bajramovic08:GUS.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/35/d3/35d3895cffeccc76d447f6db1f406ff450d7573b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5244/c.22.74"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Unsupervised Path Regression Networks [article]

Michal Pándy, Daniel Lenton, Ronald Clark
<span title="2021-03-09">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our method beats state-of-the-art supervised learning baselines for shortest path planning, with a much more scalable training pipeline, and a significant speedup in inference time.  ...  We demonstrate that challenging shortest path problems can be solved via direct spline regression from a neural network, trained in an unsupervised manner (i.e. without requiring ground truth optimal paths  ...  The paths obtained by minimizing C are collision-free with the shortest possible lengths for the given number of control points. Figure 4 : 4 Predicting paths from real-world RGB-D images.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.14787v2">arXiv:2011.14787v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/meup5rafr5b6djqj3oymyjrzmi">fatcat:meup5rafr5b6djqj3oymyjrzmi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201204014005/https://arxiv.org/pdf/2011.14787v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/69/34/693440a1300e8ec6958dfc41ebc371cd715a3ccc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.14787v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Surface Mesh to Volumetric Spline Conversion with Generalized Polycubes

Bo Li, Xin Li, Kexiang Wang, Hong Qin
<span title="">2013</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hjrujdrg7zaghbdsp5pdzq7cmm" style="color: black;">IEEE Transactions on Visualization and Computer Graphics</a> </i> &nbsp;
Our volumetric modeling scheme has great potential in shape modeling, engineering analysis, and reverse engineering applications.  ...  Our new splines are defined upon a novel parametric domain called generalized polycubes (GPCs). A GPC comprises a set of regular cube domains topologically glued together.  ...  In theory, a transition function ij from cube domains D j to D i is a composition of translations and rotations following the shortest path from cube D j to cube D i in the GPC-graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tvcg.2012.177">doi:10.1109/tvcg.2012.177</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/23846098">pmid:23846098</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nxicvamr2ra6bczc37q527xrju">fatcat:nxicvamr2ra6bczc37q527xrju</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161011141056/http://www3.cs.stonybrook.edu/~qin/research/2013-tvcg-generalized-polycubes.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e2/68/e2688bd202659ec358f28ba64a62d147c124d173.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tvcg.2012.177"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Gross motion planning---a survey

Yong K. Hwang, Narendra Ahuja
<span title="1992-09-01">1992</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/eiea26iqqjcatatlgxdpzt637y" style="color: black;">ACM Computing Surveys</a> </i> &nbsp;
This paper surveys the work on gross-motionplanning, including motion planners for point robots, rigid robots, and manipulators in stationary, time-varying, constrained, and movable-object environments.The  ...  For example, to plan a shortest path for a submarine, one must settle for a heuristic algorithm since the 3D shortest-path problem is NP-hard.  ...  A rule is used to delete vertices in the list that can no longer lie on the shortest path.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/136035.136037">doi:10.1145/136035.136037</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ylshsgnr5jhkje2uruafaf7bpa">fatcat:ylshsgnr5jhkje2uruafaf7bpa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20040731222433/http://students.cs.byu.edu:80/~cs470ta/articles/p219-hwang.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d9/24/d9240ec9d08947276b0449de69065ac6cf53aa6c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/136035.136037"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Genetic Algorithm Based Solution for TSP on a Sphere

Aybars Uğur, Serdar Korukoğlu, Ali Çalıskan, Muhammed Cinsdikici, Ali Alp
<span title="2009-12-01">2009</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/y2lwqwd3kfeihhzz5qdvdjhaqq" style="color: black;">Mathematical and Computational Applications</a> </i> &nbsp;
Various exact or approximation algorithms are devised for solving Euclidean TSP that determine the shortest route through a given set of points in 3-dimensional Euclidean space.  ...  In this paper, we proposed a genetic algorithm-based solution for TSP where all points are on the surface of a sphere.  ...  A path planning study and solution to the TSP on a cuboid can be found in [15] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/mca14030219">doi:10.3390/mca14030219</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xipkhfmbbzddndm5o4y5aqi7wy">fatcat:xipkhfmbbzddndm5o4y5aqi7wy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180726100410/https://res.mdpi.com/def502007017aa251482690e3eb5f6b4540ea30713fe16eca64d846d5d8bb01a89537119772c15067b5be650d1122faf831b025775a4a986cf95b2463fa4a93d759bb092e9baf47687ef275ba48c8e9a43a5ea9c8dab7183042a6efcfcd0d9709e43e17287d6a6581286d95a68d0e23211e88094fce028985970dc9dd36344134bfdaea2?filename=&amp;attachment=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f9/ab/f9ab10a7754c65b1a4e0867494e296bb942eb103.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/mca14030219"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 833 results