Offset of curves on tessellated surfaces

Holla, V. Devaraja; Shastry, K.; Prakash, B.G.

doi:10.1016/s0010-4485(02)00181-1

Cited by 17 publications

(10 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Articles [13][14] state path planning algorithms based on the meshed model, but the algorithms are mainly for the closed surface. Reference [15] presents a path planning algorithm for the open-contoured surface with isometric laying. The surface can be completely covered using this method.…”

Section: Introductionmentioning

confidence: 99%

Path planning of airfoil surface for robotic fibre placement

Wang

et al. 2015

2015 International Conference on Advanced Mechatronic Systems (ICAMechS)

View full text Add to dashboard Cite

In this paper, a new path planning algorithm based on triangular meshes of the airfoil open surface for four commonly used laying angles in robotic fibre placement is presented. In the proposed algorithm, the 0 o paths are computed by the slicing method, the ±45 o paths are obtained by general rotation transformation, and the method to equally divide arc is adopted to get the 90 o paths which can ensure that the complete fibre tows distributed evenly on the surface connect the root and tip part. Then the redundant path points are deleted, the final path points are obtained to generate the poses of the fibre placement head which is mounted at the robot manipulator's end-effector. Finally the simulation is carried out in software RobotStudio and the effect of laying is displayed using OpenGL. The simulation results verify the effectiveness of the proposed method.

show abstract

Section: Introductionmentioning

confidence: 99%

Path planning of airfoil surface for robotic fibre placement

Wang

et al. 2015

2015 International Conference on Advanced Mechatronic Systems (ICAMechS)

View full text Add to dashboard Cite

show abstract

“…In [1], general offset curves are treated in the context of Minkowski geometry of the two-dimensional plane, stemming from the consideration of a strictly convex, centrally symmetric given curve as its unit circle. An algorithm to offset curves on tessellated surfaces is presented with tessellated representation for both curves and surfaces by Holla [19].…”

Section: Introductionmentioning

confidence: 99%

Two-dimensional offsets and medial axis transform

Choi

Han

et al. 2007

Adv Comput Math

View full text Add to dashboard Cite

show abstract

“…Holla et al [38] proposed an incremental approach to approximate polyline-source offsets based on an assumption that the offset to a polyline on the surface is still a polyline. Chen et al [13] computed approximate offsets by taking the samples on the source curve as source points.…”

Section: Objectives and Contributionsmentioning

confidence: 99%

“…However, very few algorithms are available for computing discrete geodesic offsets on polygonal meshes. Holla et al [38] computed offsets at distances d 1 , d 2 , · · · , d k from the source curve, where d i < d i+1 , i = 1, 2, · · · , k.…”

Section: Geodesic Offsetsmentioning

confidence: 99%

“…Chen et al [13] took a set of sample points on the source curve as source points and then computed the geodesic offset at a given distance. Both [38] and [13] are approximate algorithms that require interactive detection and correction of global self-intersections. Lensch et al [49] extended the MMP algorithm [58] onto the polyline-source geodesic offset problem.…”

Section: Geodesic Offsetsmentioning

confidence: 99%

See 1 more Smart Citation

Efficient and practical algorithms for discrete geodesics

Xiang¹

View full text Add to dashboard Cite

Computing exact geodesic distance plays an important role in many graphics applications.Many research studies have been undertaken in this area since the 1980s. However, the existing geodesic algorithms are not practical for large-scale models or time-critical applications. First, the existing algorithms compute exact geodesic in a serial manner due to the lack of a parallel structure. The computation of geodesic on a large-scale model could be very time-consuming.Second, the widely studied single-source all-destination geodesic algorithms are not elegant for all-pair geodesic queries. Thus, the efficiency and practicality of geodesic computation remain I am grateful to all those who have helped and supported me throughout my PHD life.First and foremost I offer my sincerest gratitude to my supervisor, Dr. He Ying. Without his support, patience, and guidance, this study would not have been completed. His knowledge and enthusiasm on research inspired and motivated me. I have been extremely lucky to have a supervisor who cared so much about my work, and who responded to my questions and queries so promptly. One simply could not wish for a better or friendlier supervisor.

show abstract

Offset of curves on tessellated surfaces

Cited by 17 publications

References 9 publications

Path planning of airfoil surface for robotic fibre placement

Path planning of airfoil surface for robotic fibre placement

Two-dimensional offsets and medial axis transform

Efficient and practical algorithms for discrete geodesics

Contact Info

Product

Resources

About