Velocity calculation of 2D geometric objects by use of surface interpolation in 3D

Mandachi, Yojiro; Usuki, Satoshi; Miura, Kenjiro T.

doi:10.1299/jamdsm.2014jamdsm0012

Cited by 2 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In future work, we will explore new models of HW/SW co-design and new acceleration methods on Multi-core SIMD CPUs (Ouyang, et al, 2016), (Zhou, et al, 2017). We will also try to extend the proposed idea and method to other areas, such as large-scale data visualization and rendering (Chen, et al, 2017), (Inui M, et al, 2016), (Kim, Kyung and Lee, 2012), (Mandachi, Usuki and Miura, 2014), (Umezu, 2013), (Zhang, et al, 2017), large-scale co-operation editing in text and geometry in Computer-Supproted Cooperation Work (Cheng, et al, 2016), (Lv, et al, 2016), (Nomaguchi,Tsutsumi and Fujita,212), large-scale 3D model interchange and retrieval in CAD (Wu, et al, 2016), (Zhang, et al, 2016), (Komoto, Kondoh and Masui, 2016), (Yeoun and Kim, 2016), (Qin, et al, 2016, (Qin, et al, 2016 , and real-time video and large HD image processing in computer vision (Li, He and Chen, 2016), (Ni, et al, 2016), (Li, He and Chen, 2017), (Li, et al, 2017), (Li, et al, 2017), (Sun, et al, 2016), (Liu, et al, 2016),…”

Section: Discussionmentioning

confidence: 99%

A GPU-based tabu search for very large hardware/software partitioning with limited resource usage

Hou

Zhou

et al. 2017

JAMDSM

View full text Add to dashboard Cite

In hardware/software (HW/SW) co-design, HW/SW partitioning is the most important step since it determines which components are implemented in hardware and which are implemented in software. Since most of HW/SW partitioning problems are NP hard, heuristic methods have to be utilized to solve them, especially for the large size problems. GPU-based heuristic methods to accelerate HW/SW co-design are a promising way to reduce run time. However, the existing methods cannot deal with very large embedded applications because of GPU resource limitations. This paper presents a method to overcome the GPU resource limitations for very large partitioning while keeping a reasonable runtime. First, at the stage of computing the costs of the candidates, we propose a fast method of 2-flipping computing for very large HW/SW co-design. Our method is also general and can deal with both odd and even numbers of nodes. More importantly, our method avoids utilizing doubleprecision arithmetic units, which are scarce resources in GPU architecture. Second, since the GPU is constrained by memory limitations and the costs of candidates cannot be directly stored in the GPU's global memory, we present a time-space tradeoff strategy to break memory limitations for very large HW/SW partitioning. In this way, the following steps can be run under the constraint of GPU's memory limitations. Third, an in-place removal of infeasible solutions is proposed to reduce the overhead of global memory by half when the neighborhood is compacted. Fourth, when evaluating the tabu status of feasible candidates, we present a bitwise representation of tabu status to minimize the transfer overhead. Finally, we conduct a number of experiments. The results show that the proposed 2-flipping method of single precision data types works well. The results also demonstrate that the proposed approach expands the number of nodes of the task graph from 10,000 to 30,000 under the limitation of the GPU's global memory of 6 GB. The correlations between compression intensity and solution quality are analyzed to ensure the fairness and soundness of our method. Our work is general and can provide guidance for other applications.

show abstract

Section: Discussionmentioning

confidence: 99%

A GPU-based tabu search for very large hardware/software partitioning with limited resource usage

Hou

Zhou

et al. 2017

JAMDSM

View full text Add to dashboard Cite

show abstract

“…Though simple and accurate for translational motions, this condition fails to capture rotational motions. The papers [FMM13, MUM14] attempt to rectify this with another local condition based on more geometric information. Respectively, the authors propose that the curvature of the level sets should remain constant over time, and that rigid motions are solved for exactly by considering the motion of the center of mass and moment of inertia of the zero‐level set.…”

Section: Related Workmentioning

confidence: 99%

Near‐Isometric Level Set Tracking

Tao

Solomon

Butscher

2016

Computer Graphics Forum

View full text Add to dashboard Cite

Implicit representations of geometry have found applications in shape modeling, simulation, and other graphics pipelines. These representations, however, do not provide information about the paths of individual points as shapes move and undergo deformation. For this reason, we reconsider the problem of tracking points on level set surfaces, with the goal of designing an algorithm that — unlike previous work — can recover rotational motion and nearly isometric deformation. We track points on level sets of a time‐varying function using approximate Killing vector fields (AKVFs), the velocity fields of near‐isometric motions. To this end, we provide suitable theoretical and discrete constructions for computing AKVFs in a narrow band surrounding an animated level set surface. Furthermore, we propose time integrators well‐suited to integrating AKVFs in time to track points. We demonstrate the theoretical and practical advantages of our proposed algorithms on synthetic and practical tasks.

show abstract

Velocity calculation of 2D geometric objects by use of surface interpolation in 3D

Cited by 2 publications

References 5 publications

A GPU-based tabu search for very large hardware/software partitioning with limited resource usage

A GPU-based tabu search for very large hardware/software partitioning with limited resource usage

Near‐Isometric Level Set Tracking

Contact Info

Product

Resources

About