We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geographic routing protocols. This graph ...
详细信息
ISBN:
(纸本)1581134282
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: (1) it is a planar graph;(2) between any two nodes there exists a path in the RDG whose length, whether measure in terms of topological or Euclidean distance, is only a constant times the optimum length possible;and (3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We also show by simulation that the RDG outperforms the previously proposed routing graphs under the Greedy Perimeter Stateless Routing (GPSR) protocol. In addition, we investigate theoretical bounds on the quality of paths discovered using GPSR.
This paper presents an object-oriented approach for creating multi-region non-manifold models with NURBS. The main motivation is that the geometry and shape of realistic engineering objects are intrinsically complex, ...
详细信息
This paper presents an object-oriented approach for creating multi-region non-manifold models with NURBS. The main motivation is that the geometry and shape of realistic engineering objects are intrinsically complex, usually composed by several materials and regions. Therefore, automatic and/or adaptive meshing algorithms have become revealed themselves quite useful to increase the reliability of the procedures of a FEM numerical analysis. The present approach is concerned with two aspects of 3D FEM simulation: geometric modeling, with automatic multi-region detection, and support to automatic finite element mesh generation. The final objective is to use geometric models directly in numerical applications.
Visualization of particle traces provides intuitive and efficient means for the exploration and analysis of complex vector fields. The paper presents a method suitable for the real-time visualization of arbitrarily la...
详细信息
ISBN:
(纸本)0780372239
Visualization of particle traces provides intuitive and efficient means for the exploration and analysis of complex vector fields. The paper presents a method suitable for the real-time visualization of arbitrarily large time-varying vector fields in virtual environments. We describe an out-of-core scheme in which two distinct pre-processing and rendering components enable real-time data streaming and visualization. The presented approach yields low-latency application start-up times and small memory footprints. The described system was used to implement a "volumetric fog lance," which can emit up to 60000 particles into a flow field while maintaining an interactive frame rate of 60 frames per second. All algorithms were specifically designed to support commodity hardware. The proof-of-concept system is running on a low-cost Linux workstation equipped with a 120 GB E-IDE RAID (redundant array of inexpensive disk) system.
We consider the problem of maintaining connected components in a set of moving objects using the kinetic data structure (KDS) framework. We assume that the motion of each object can be specified by a low-degree algebr...
ISBN:
(纸本)9780898714906
We consider the problem of maintaining connected components in a set of moving objects using the kinetic data structure (KDS) framework. We assume that the motion of each object can be specified by a low-degree algebraic trajectory; this trajectory, however, can be modified in an on-line fashion. While the objects move continuously, their connectivity changes at discrete times. A straightforward dynamic graph approach for maintaining connectivity of n objects has three shortcomings: the graph can have Ω(n2) edges, the update bounds are amortized, and the algorithm is very complicated. Our first result shows that the connectivity for a set of n moving hypercubes can be maintained using a very simple, easy to determine graph with Ο(n) edges. But this graph still requires a general-purpose dynamic graph scheme for connectivity maintenance. Our main result is a simplified connectivity data structure for moving rectangles in the plane. For this special but important case, we are able to overcome all three shortcomings mentioned above: our graph has Ο(n) edges; our data structure supports updates in Ο(log2 n) worst-case time; and the algorithm and data structures are quite a bit simpler than those based on a general dynamic graph scheme.
Professor John Belcher developed a series of short videos with animation and text of selected experiments to properly demonstrate the phenomena of electromagnetism. Such 3D animations are visually compelling, instilli...
详细信息
Professor John Belcher developed a series of short videos with animation and text of selected experiments to properly demonstrate the phenomena of electromagnetism. Such 3D animations are visually compelling, instilling in the student both a sense of wonder about the phenomena and a mental model of why and how it works. The products of these approach includes video clips of demonstrations, 3D animations of these demonstration which display time changing field-lines as a guide to understanding their dynamical effects and Java applets which allow the student to actively construct and animate 2D field lines for varying configurations of sources. These technologies are also implemented to develop animations for Faraday's insights, using video clips.
The various institution and developments in the field of computergraphics in Germany is discussed. The German Research Foundation( DFG), as recognition of research in computergraphics, sponsors a special interdiscip...
详细信息
The various institution and developments in the field of computergraphics in Germany is discussed. The German Research Foundation( DFG), as recognition of research in computergraphics, sponsors a special interdisciplinary graduates study program on 3D image analysis and synthesis at the University of Erlangen-Nuremburg. The German Association for Informatics, founded in 1983, brings together about 40 representatives from Universities, colleges and industry that co-ordinate activities form five subgroups specializing in foundations and systems, imaging and visualization, graphical user interfaces, simulation and animation, and geometric modeling. Several companies and forums working in the area of computergraphics are situated in Darmstadt.
An overview of the research and development of computergraphics in China, especially in the area of virtual reality, is discussed. computergraphics performs an important role in both academia and industry and enable...
详细信息
An overview of the research and development of computergraphics in China, especially in the area of virtual reality, is discussed. computergraphics performs an important role in both academia and industry and enables a broad variety of applications like CAD, CAM, geographical information systems (GIS), publishing, games and film making industries. Universities and Institutes are the main units engaged in the research and development of computer graphic techniques. computer graphic research includes visualization, geometric modeling, computer-aided geometric design, and realistic rendering. It is expected that researchers in China will continue to make promising achievements and contributions in the field of computergraphics.
Most systems that support visual interaction with 3D models use shape representations based on triangle meshes. Thesize of these representations imposes limits on applications for which complex 3D models must be acces...
详细信息
Most systems that support visual interaction with 3D models use shape representations based on triangle meshes. The
size of these representations imposes limits on applications for which complex 3D models must be accessed remotely. Techniques for
simplifying and compressing 3D models reduce the transmission time. Multiresolution formats provide quick access to a crude model
and then refine it progressively. Unfortunately, compared to the best nonprogressive compression methods, previously proposed
progressive refinement techniques impose a significant overhead when the full resolution model must be downloaded. The CPM
(Compressed Progressive Meshes) approach proposed here eliminates this overhead. It uses a new technique, which refines the
topology of the mesh in batches, which each increase the number of vertices by up to 50 percent. Less than an amortized total of 4 bits
per triangle encode where and how the topological refinements should be applied. We estimate the position of new vertices from the
positions of their topological neighbors in the less refined mesh using a new estimator that leads to representations of vertex
coordinates that are 50 percent more compact than previously reported progressive geometry compression techniques.
Steganography is a method of communication which hides the existence of the communication from a third *** employment of steganographic techniques depends on various demands, which will be derived and considered. This...
详细信息
暂无评论