Results 1  10
of
461,638
A BreadthFirst Approach To Efficient Mesh Traversal
 In Proceedings of the 13th ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware
, 1998
"... Complex 3D polygonal models are typically represented as triangular meshes, especially when they are generated procedurally, or created from volumetric data sets through surface extraction. Existing 3D rendering hardware, on the other hand, processes one triangle at a time. Therefore triangle meshes ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
meshes need to be converted to individual triangles when they are fed to the graphics pipeline. The design goal of such conversion algorithms is to minimize the number of vertices that are sent redundantly to the rendering pipeline. This paper proposes a breadthfirst approach to traverse triangle meshes
Lineartime breadthfirst tree algorithms An exercise in the arithmetic of folds and zips
 Dept of Computer Science, University of Auckland
, 1992
"... This is a paper about an application of the mathematics of zip, fold (reduce) and accumulate (scan) operations on lists. It gives an account of the derivation of a lineartime breadthfirst enumeration function, and of a subtle and efficient breadthfirst tree labelling function. 1 Breadthfirst ord ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
This is a paper about an application of the mathematics of zip, fold (reduce) and accumulate (scan) operations on lists. It gives an account of the derivation of a lineartime breadthfirst enumeration function, and of a subtle and efficient breadthfirst tree labelling function. 1 Breadthfirst
Parallel BreadthFirst BDD Construction
 In Ninth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
, 1997
"... With the increasing complexity of protocol and circuit designs, formal verification has become an important research area and binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. This paper presents a parallel algorithm for BDD construction targeted at shared ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
at shared memory multiprocessors and distributed shared memory systems. This algorithm focuses on improving memory access locality through specialized memory managers and partial breadthfirst expansion, and on improving processor utilization through dynamic load balancing. The results on a shared memory
Breadthfirst heuristic search
 Artificial Intelligence
"... Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divideandconquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadthfirst instead of a bestfirst search strategy. We ..."
Abstract

Cited by 55 (11 self)
 Add to MetaCart
. We describe optimal and approximate breadthfirst heuristic search algorithms that use divideandconquer solution reconstruction. Computational results show that they outperform other optimal and approximate heuristic search algorithms in solving domainindependent planning problems.
Spatial Joins Using Rtrees: BreadthFirst Traversal with Global Optimizations
 Proc. of VLDB
, 1997
"... Rtree based spatial join is useful because of both its superior performance and the wide spread implementation of Rtrees. We present a new Rtree join method called BFRJ (BreadthFirst Rtree Join). BFRJ synchronously traverses both Rtrees in breadthfirst order while processing join computation o ..."
Abstract

Cited by 100 (4 self)
 Add to MetaCart
Rtree based spatial join is useful because of both its superior performance and the wide spread implementation of Rtrees. We present a new Rtree join method called BFRJ (BreadthFirst Rtree Join). BFRJ synchronously traverses both Rtrees in breadthfirst order while processing join computation
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
Linear pattern matching algorithms
 IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE
, 1972
"... In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear ti ..."
Abstract

Cited by 549 (0 self)
 Add to MetaCart
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear
A Compressed BreadthFirst Search for Satisfiability
 Proc. 4th Workshop on Algorithm Engineering and Experiments
, 2002
"... Leading algorithms for Boolean satisfiability (SAT) are based on either a depthfirst tree traversal of the search space (the DLL procedure [6]) or resolution (the DP procedure [7]). In this work we introduce a variant of BreadthFirst Search (BFS) based on the ability of ZeroSuppressed Binary De ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
Leading algorithms for Boolean satisfiability (SAT) are based on either a depthfirst tree traversal of the search space (the DLL procedure [6]) or resolution (the DP procedure [7]). In this work we introduce a variant of BreadthFirst Search (BFS) based on the ability of ZeroSuppressed Binary
The Nature of BreadthFirst Search
, 1999
"... BFS is one of the classical graph theory algorithms, typically expressed under the imperative style. However, it has applications in other domains such as artificial intelligence. All known algorithms of BFS use iteration. This article focuses on the information maintained by BFS during exploration ..."
Abstract
 Add to MetaCart
of an arbitrary graph component. To better understand the structure of this information, BFS is redefined both recursively and iteratively. Also provided in this article is an analysis and comparison of the various BFS algorithms presented. 1 Introduction Breadthfirst search (BFS) is one of the oldest and most
DistributedMemory BreadthFirst Search on Massive Graphs ∗
"... In this chapter, we study the problem of traversing large graphs. A traversal, a systematic method of exploring all the vertices and edges in a graph, can be done in many different orders. A traversal in “breadthfirst ” order, a breadthfirst search (BFS), is important because it serves as a buildi ..."
Abstract
 Add to MetaCart
In this chapter, we study the problem of traversing large graphs. A traversal, a systematic method of exploring all the vertices and edges in a graph, can be done in many different orders. A traversal in “breadthfirst ” order, a breadthfirst search (BFS), is important because it serves as a
Results 1  10
of
461,638