line segment intersection
Recently Published Documents


TOTAL DOCUMENTS

23
(FIVE YEARS 0)

H-INDEX

6
(FIVE YEARS 0)

2014 ◽  
Vol 513-517 ◽  
pp. 2663-2667
Author(s):  
Jian Hua Hao ◽  
Dian Fei Pan ◽  
Nai Ping Cheng

A flexible hemispherical coverage array antenna based on multi-planar arrays is proposed to meet the growing demands for multi-target TT&C. The advantages and disadvantages of multi-planar arrays and dome phased in engineering implement are compared. Meanwhile, the influence of different number of plane arrays on antenna pattern is analyzed. For the purpose of interference suppression a novel beamforming method by adding constraint conditions is analyzed to enhance the performance of antenna for TT&C system. Considering the influence of occultation effect on the antenna performance, an effective occultation algorithm is presented. Firstly, the faces in bright area are projected on the plane that is perpendicular with the direction of receiving wave. Secondly, adopting the principle of line segment intersection, the intersect relationship of projective planes is determined. Finally, the facets shadowing relationship is judged by the overlapping and depth-of-view of facets along the receiving wave direction. Theoretical analyses and simulation results show that the antenna has approximate uniform gain beampattern in different steered angle and the occultation algorithm is feasible and effective.


2011 ◽  
Vol 219-220 ◽  
pp. 223-227
Author(s):  
Xi Juan Guo ◽  
Lei Chang ◽  
Yan Li Gao

The overlay algorithm is an important branch in computational geometry field, it is an important process for computing exact Minkowski sum of two convex polyhedrons. By improving the existing plane sweep algorithm, the overlay algorithm for simple subdivision of arbitrary polygon in plane is given. The algorithm can be used to overlay arbitrary polygon after subdivision into simple polygon in the plane. It has lower time complexity than the existing overlay algorithm. The whole algorithm consists of three steps: line segment intersection, reconstructing topology and constructing the DCEL for overlay graph. The results show that the algorithm can compute the overlay of two planar subdivisions in linear time.


2009 ◽  
Vol 12 (4) ◽  
pp. 257-264 ◽  
Author(s):  
Qin Zhou ◽  
Ershun Zhong ◽  
Yaohuan Huang

2007 ◽  
Vol 38 (3) ◽  
pp. 213-230 ◽  
Author(s):  
Jan Vahrenhold

Computing ◽  
2005 ◽  
Vol 75 (4) ◽  
pp. 337-357 ◽  
Author(s):  
Y.-K. Zhu ◽  
J.-H. Yong ◽  
G.-Q. Zheng

Sign in / Sign up

Export Citation Format

Share Document