Results 1  10
of
1,716
Navigation queries from triangular meshes
 In Motion in Games
, 2010
"... Abstract. Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games. This paper explores the use of triangulations as a navigation mesh, and discusses several useful triangulationâ€“based a ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Abstract. Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games. This paper explores the use of triangulations as a navigation mesh, and discusses several useful triangulation
Mesh Optimization
, 1993
"... We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy f ..."
Abstract

Cited by 392 (8 self)
 Add to MetaCart
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy
NeTra: A toolbox for navigating large image databases
 Multimedia Systems
, 1999
"... . We present here an implementation of NeTra, a prototype image retrieval system that uses color, texture, shape and spatial location information in segmented image regions to search and retrieve similar regions from the database. A distinguishing aspect of this system is its incorporation of a robu ..."
Abstract

Cited by 382 (15 self)
 Add to MetaCart
. We present here an implementation of NeTra, a prototype image retrieval system that uses color, texture, shape and spatial location information in segmented image regions to search and retrieve similar regions from the database. A distinguishing aspect of this system is its incorporation of a
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 405 (11 self)
 Add to MetaCart
dimensions, and the desired output is a triangular mesh with vertex set equal to S that faithfully represen...
Disseminating Active Map Information to Mobile Hosts
, 1994
"... Mobile computing differs from desktop computing because of the dynamic nature of system state: as users move, the sets of stationary and mobile objects they control and the types of information they wish to access change. Navigating a mobile environment can be aided by active maps that describe ..."
Abstract

Cited by 342 (2 self)
 Add to MetaCart
Mobile computing differs from desktop computing because of the dynamic nature of system state: as users move, the sets of stationary and mobile objects they control and the types of information they wish to access change. Navigating a mobile environment can be aided by active maps that describe
Delaunay Refinement Algorithms for Triangular Mesh Generation
 Computational Geometry: Theory and Applications
, 2001
"... Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of tria ..."
Abstract

Cited by 175 (0 self)
 Add to MetaCart
of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most
Fault Localization with Nearest Neighbor Queries
, 2003
"... We present a method for performing fault localization using similar program spectra. Our method assumes the existence of a faulty run and a larger number of correct runs. It then selects according to a distance criterion the correct run that most resembles the faulty run, compares the spectra corres ..."
Abstract

Cited by 234 (2 self)
 Add to MetaCart
corresponding to these two runs, and produces a report of "suspicious" parts of the program. Our method is widely applicable because it does not require any knowledge of the program input and no more information from the user than a classification of the runs as either "correct" or "
Mean value coordinates for closed triangular meshes
 ACM Trans. Graph
"... Figure 1: Original horse model with enclosing triangle control mesh shown in black (a). Several deformations generated using our 3D mean value coordinates applied to a modified control mesh (b,c,d). Constructing a function that interpolates a set of values defined at vertices of a mesh is a fundamen ..."
Abstract

Cited by 143 (11 self)
 Add to MetaCart
coordinates from closed 2D polygons to closed triangular meshes. Given such a mesh P, we show that these coordinates are continuous everywhere and smooth on the interior of P. The coordinates are linear on the triangles of P and can reproduce linear functions on the interior of P. To illustrate
Metamorphosis of Arbitrary Triangular Meshes
 ABSTRACT TO APPEAR IN IEEE COMPUTER GRAPHICS AND APPLICATIONS
"... Recently, animations with deforming objects have been frequently used in various computer graphics applications. Metamorphosis (or morphing) of threedimensional objects is one of the techniques which realizes shape transformation between two or more existing objects. In this paper, we present an ef ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
. Based on this correspondence, metamorphosis is achieved by interpolating the corresponding vertices from one mesh 1 to the other. We demonstrate that the minimum control of surface correspondences by the user generates sophisticated results of the interpolation between two meshes.
Jungloid Mining: Helping To Navigate the API Jungle
 Proceedings of the 2005 SIGPLAN Conference on Programming Languages Design and Implementation
"... Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We observed that a common scenario is that the programmer knows what type of object he needs, but does not know how to write the c ..."
Abstract

Cited by 174 (1 self)
 Add to MetaCart
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We observed that a common scenario is that the programmer knows what type of object he needs, but does not know how to write
Results 1  10
of
1,716