Searching for "Visualization of Distributed Processes Using "Data Jewelry Box" Algorithm." – sorted by Relevance.
-
A new aesthetic evolutionary approach for jewelry design
- random iteration algorithm (RIA) [10]. 3.1 Capacity Dimension (F1) Box-counting or box dimension is used
- Cited by 2 (1 self) – Add To MetaCart
-
CAD/CAM Methods for Reverse Engineering: A Case Study of Re-engineering Jewelry
- reverse engineering. Section 5 presents issues that arise in jewelry reengineering using the framework
- Cited by 1 (0 self) – Add To MetaCart
-
Causal Boxes and Hierarchical Time Boxes
- the following algorithm constructs the maximal branching process #m = (B, E, G, #) of N nondeterministically
- Add To MetaCart
-
Scattered data interpolation by box splines
- with the interpolation of scattered data using box splines. Previously, only cardinal box spline interpolation (data on a
- Add To MetaCart
-
Enclosing Many Boxes By an Optimal Pair of Boxes
- case, using linear space. Furthermore, we propose a variation of our algorithm that is faster in low
- Cited by 17 (3 self) – Add To MetaCart
-
Ray Tracing with Sparse Boxes
- and their discussion. Finally, Section 7 concludes the paper. 4 Sparse Boxes Our new traversal algorithms make use
- Cited by 1 (1 self) – Add To MetaCart
-
Counting colors in boxes
- algorithms for preprocessing P into a data structure that efficiently supports queries of the form: Given
- Cited by 2 (1 self) – Add To MetaCart
-
Stable Evaluation of Box Splines
- way to evaluate box-splines is by using their recursive definition. However, a straightforward
- Cited by 1 (0 self) – Add To MetaCart
-
Optimized View Frustum Culling Algorithms for Bounding Boxes
- Optimized View Frustum Culling Algorithms for Bounding Boxes Ulf Assarsson and Tomas Möller
- Cited by 29 (0 self) – Add To MetaCart
-
An efficient and robust ray-box intersection algorithm
- An Efficient and Robust Ray–Box Intersection Algorithm Amy Williams Steve Barrus R. Keith Morley
- Cited by 5 (1 self) – Add To MetaCart

