Sciweavers

108 search results - page 16 / 22
» Constant-Work-Space Algorithm for a Shortest Path in a Simpl...
Sort
View
VISUALIZATION
1995
IEEE
13 years 11 months ago
Automatic Generation of Triangular Irregular Networks Using Greedy Cuts
We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greed...
Cláudio T. Silva, Joseph S. B. Mitchell, Ar...
3DIM
2005
IEEE
14 years 1 months ago
A Contour-Based Approach to 3D Text Labeling on Triangulated Surfaces
This paper presents a simple and efficient method of forming a 3D text label on a 3D triangulated surface. The label is formed by projecting the 2D contours that define the text...
Gregory G. Slabaugh, Viorel Mihalef, Gozde B. Unal
SIAMDM
1998
55views more  SIAMDM 1998»
13 years 7 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu
IJCGA
2008
114views more  IJCGA 2008»
13 years 7 months ago
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
Magdalene G. Borgelt, Christian Borgelt, Christos ...
SECON
2010
IEEE
13 years 5 months ago
Multi-Constrained Anypath Routing in Wireless Mesh Networks
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
Xi Fang, Dejun Yang, Pritam Gundecha, Guoliang Xue