Filters








91 Hits in 6.0 sec

HIERARCHICAL PATH PLANNING FOR WALKING (ALMOST) ANYWHERE

K. Landmark, E. Messel
2018 The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
This basal graph is partitioned into strongly connected subgraphs such that the generalized diameter of each subgraphs is constrained by a set value, and with nominally as few subgraphs as possible.  ...  This paper develops a method for general path planning intended to work across arbitrary distances and at the level of terrain detail afforded by aerial LiDAR scanning.  ...  ACKNOWLEDGEMENTS (OPTIONAL) The authors thank the Norwegian Defence Research Establishment (FFI) for support and permission to publish this work.  ... 
doi:10.5194/isprs-archives-xlii-4-w8-109-2018 fatcat:ihxe7ojx4fc6pgmxqdauq6jkl4

On the Problem of Covering a 3-D Terrain

Eduard Eiben, Isuru Godage, Iyad Kanj, Ge Xia
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We model the terrain as a mesh in a way that captures the elevation levels of the terrain; this enables a graph-theoretic formulation of the problem in which the underlying graph is a weighted plane graph  ...  Finally, we implement two heuristic algorithms based on greedy approaches and report our findings.  ...  Figure 1 shows a randomly-generated terrain and the paths generated by the two algorithms when applied to this terrain.  ... 
doi:10.1609/aaai.v34i06.6603 fatcat:xjdhhjojrvgsfcxfgccsm2hacm

A Geometry-aware Data Partitioning Algorithm for Parallel Quad Mesh Generation on Large-scale 2D Regions

Wuyi Yu, Xin Li
2015 Procedia Engineering  
First, we partition the region into a set of cells using L ∞ Centroidal Voronoi Tessellation (CVT), then we solve a graph partitioning on the dual graph of this CVT to minimize the total partitioning boundary  ...  We demonstrate that our decomposition algorithm outperforms existing approaches by offering a higher-quality partitioning, and therefore, improved performance and quality in mesh generation.  ...  Given a (dual) graph G = (V G , E G ), for any pair of non-adjacent nodes u, v, we define a node set S ⊂ V \ {u, v} to be a nodecut set that separates u and v, if there is no path between u and v after  ... 
doi:10.1016/j.proeng.2015.10.121 fatcat:k4f47lns4nhzpog4gb3tfwm24i

K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks

Bheemarjuna Reddy Tamma, Anirudh Badam, C. Siva Ram Murthy, Ramesh R. Rao
2010 Computer Networks  
We prove that finding a given number of node-disjoint multicast trees for a multicast session in a given network is NP-Hard.  ...  Hence, we propose a multiple tree multicast protocol which maintains maximally node-disjoint multicast trees in the network to attain robustness against path breaks.  ...  In mesh-based multicast routing protocols, there exists mesh structures that are a set of interconnected nodes which can provide more than one path between source-receiver pair.  ... 
doi:10.1016/j.comnet.2010.02.013 fatcat:h7upph2zczgbbh57anzib7jhcm

External Memory View-Dependent Simplification

Jihad El-Sana, Yi-Jen Chiang
2000 Computer graphics forum (Print)  
Our new preprocessing algorithm places the dataset in disk, and constructs view-dependence trees I/Oefficiently. This is based on a novel, I/O-efficient spanned sub-meshes simplification technique.  ...  In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory.  ...  We would like to thank the reviewers for their insightful comments which led to several improvements in the presentation of this paper.  ... 
doi:10.1111/1467-8659.00406 fatcat:n4lusiwmsbh47fochk5dqjazja

Single-Strip Triangulation of Manifolds with Arbitrary Topology [article]

M. Gopi, David Eppstein
2004 arXiv   pre-print
Our method applies a dual graph matching algorithm to partition the mesh into cycles, and then merges pairs of cycles by splitting adjacent triangles when necessary.  ...  In this paper, we present a new algorithm for creating a single triangle loop or strip from a triangulated model.  ...  For example, algorithms presented in [AHMS96] avoid Delaunay triangulation of the planar point set and create a Hamiltonian path triangulation.  ... 
arXiv:cs/0405036v1 fatcat:5i6vzyoz75g4dizrh24xbrskia

Single-Strip Triangulation of Manifolds with Arbitrary Topology

M. Gopi, David Eppstien
2004 Computer graphics forum (Print)  
Our method applies a dual graph matching algorithm to partition the mesh into cycles, and then merges pairs of cycles by splitting adjacent triangles when necessary.  ...  In this paper, we present a new algorithm for creating a single triangle loop or strip from a triangulated model.  ...  For example, algorithms presented in [AHMS96] avoid Delaunay triangulation of the planar point set and create a Hamiltonian path triangulation.  ... 
doi:10.1111/j.1467-8659.2004.00768.x fatcat:4vl2ly5q55b2xmgnjdd5kesuny

Single-strip triangulation of manifolds with arbitrary topology

David Eppstein, M. Gopi
2004 Proceedings of the twentieth annual symposium on Computational geometry - SCG '04  
Our method applies a dual graph matching algorithm to partition the mesh into cycles, and then merges pairs of cycles by splitting adjacent triangles when necessary.  ...  In this paper, we present a new algorithm for creating a single triangle loop or strip from a triangulated model.  ...  For example, algorithms presented in [AHMS96] avoid Delaunay triangulation of the planar point set and create a Hamiltonian path triangulation.  ... 
doi:10.1145/997817.997888 dblp:conf/compgeom/EppsteinG04 fatcat:3hnh3thobff5bbe2zr6q5a5hpq

Single-strips for fast interactive rendering

Pablo Diaz-Gutierrez, Anusheel Bhushan, M. Gopi, Renato Pajarola
2006 The Visual Computer  
We present new algorithms to generate single-strip representations that follow different user defined constraints or preferences in the form of edge weights.  ...  We present new algorithms to generate single-strip representations that follow different user defined constraints or preferences in the form of edge weights.  ...  time: Average time (in seconds) spent in the two main preprocessing stages of our algorithm: Mesh face clustering for back-face culling optimization, and graph perfect matching of the dual graph.  ... 
doi:10.1007/s00371-006-0018-2 fatcat:4qnnjv2wdne25mhixem75yzfgm

Topological Quadrangulations of Closed Triangulated Surfaces Using the Reeb Graph [chapter]

Franck Hétroy, Dominique Attali
2002 Lecture Notes in Computer Science  
In order to construct on the surface a quadrangulation of its canonical polygonal schema, we compute first a Reeb graph then a canonical set of generators embedded on the surface.  ...  This paper presents a method for the construction of coarse topological quadrangulations of closed triangulated surfaces, based on Morse theory.  ...  Acknowledgments The authors would like to thank Francis Lazarus for fruitful discussions and helpful comments, especially concerning the number of cycles in the Reeb graph.  ... 
doi:10.1007/3-540-45986-3_5 fatcat:32k6dpt5erfctk4u5azkkcxufa

Topological quadrangulations of closed triangulated surfaces using the Reeb graph

Franck Hétroy, Dominique Attali
2003 Graphical Models  
In order to construct on the surface a quadrangulation of its canonical polygonal schema, we compute first a Reeb graph then a canonical set of generators embedded on the surface.  ...  This paper presents a method for the construction of coarse topological quadrangulations of closed triangulated surfaces, based on Morse theory.  ...  Acknowledgments The authors would like to thank Francis Lazarus for fruitful discussions and helpful comments, especially concerning the number of cycles in the Reeb graph.  ... 
doi:10.1016/s1524-0703(03)00005-5 fatcat:m5htgsbkfzc35lbku2qtr52n2q

Optimized Group Channel Assignment Using Computational Geometry over Wireless Mesh Networks

Anitha Manikandan, Yogesh Palanichamy
2015 Mobile Information Systems  
The number of nonoverlapping channels available is less than the number of mesh nodes; hence, the same channel will be shared among many nodes.  ...  Wireless Mesh Networks (WMNs) are an evolving division in the field of wireless networks due to their ease of deployment and assured last mile connectivity.  ...  Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper. Mobile Information Systems  ... 
doi:10.1155/2015/718079 fatcat:o3s4dhaazjh3xmdus6bkpqslva

High level communication functionalities for wireless sensor networks

Carme Àlvarez, Josep Díaz, Jordi Petit, José Rolim, Maria Serna
2008 Theoretical Computer Science  
In this paper we show how to establish a reliable and efficient high level communication system in a randomly deployed network of sensors equipped with directional antennas.  ...  This high level communication system enables the programming of the sensor network using high level communication functionalities without the burden of taking care of their physical capacities (low range  ...  We have focused on the weaker model of antenna, but the results in the paper can be easily extended to other models of antenna: the omnidirectional, the orientable-directional, the broadcast-unicast and  ... 
doi:10.1016/j.tcs.2008.06.055 fatcat:3qzk74vvdffhzo22vyhenltvoq

Optimal Graph Search Based Segmentation of Airway Tree Double Surfaces Across Bifurcations

Xiaomin Liu, Danny Z. Chen, Merryn H. Tawhai, Xiaodong Wu, Eric A. Hoffman, Milan Sonka
2013 IEEE Transactions on Medical Imaging  
In this paper, we extend a graph search based technique (LOGISMOS) to simultaneously identify multiple inter-related surfaces of branching airway trees.  ...  The presegmented image is resampled along judiciously determined paths to produce a set of vectors of voxels (called voxel columns).  ...  The graph G contains k disjoint subgraphs, each of which corresponds to searching one of k sought surfaces (k = 2 in our case). These k subgraphs are connected by inter-surface edges in G.  ... 
doi:10.1109/tmi.2012.2223760 pmid:23070299 pmcid:PMC4086865 fatcat:zhkxnbjjfzcvdb3ieod4veutoi

Local Routing in Graphs Embedded on Surfaces of Arbitrary Genus [article]

Maia Fraser
2012 arXiv   pre-print
This algorithm, GFR, may be viewed as a suitable generalization of Face Routing (FR), the well-known algorithm for plane graphs, which we previously showed does not guarantee delivery in graphs embedded  ...  GFR should be viewed in the same light, as a base algorithm which could for example be tailored to sensor networks on surfaces in 3D.  ...  In other words if Γ * is the subgraph of Γ obtained by removing all edges of the form γ ∩ R(G) then the path of interest exists even in Γ * .  ... 
arXiv:1202.6109v1 fatcat:eha2npapgrbpjhtbjrjea7a6ie
« Previous Showing results 1 — 15 out of 91 results