Log in

Relevant bibliographies by topics / Polygon clipping algorithm / Journal articles

To see the other types of publications on this topic, follow the link: Polygon clipping algorithm.

Journal articles on the topic 'Polygon clipping algorithm'

Author: Grafiati

Published: 4 June 2021

Last updated: 2 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 16 journal articles for your research on the topic 'Polygon clipping algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Chieng, Wei-Hua, and D. A. Hoeltzel. "Polygon-to-Object Boundary Clipping in Object Space for Hidden Surface Removal in Computer-Aided Design." Journal of Mechanical Design 117, no. 3 (September 1, 1995): 374–89. http://dx.doi.org/10.1115/1.2826690.

Full text

Abstract:

Since techniques for both polygon-to-polygon clipping and polygon-to-object boundary (contour) clipping have been developed, it appears that the visibility problem may exhibit potential for improvement in its time complexity. This paper provides some insight and results concerning the performance of an object-space hidden surface removal algorithm based on polygon-to-object boundary (contour) clipping. The applicability of these results to the graphic rendering of partially visible objects in an incremental computer-aided geometric design system, such as that used in mechanical design, is demonstrated. The polygon-to-object boundary clipping algorithm is compared with the more conventional polygon-to-polygon approach to clipping for hidden surface removal. Examples are included which demonstrate the potential for improving the performance of software-based hidden surface removal algorithms used in computer-aided geometric design applications.

APA, Harvard, Vancouver, ISO, and other styles

2

Narayanaswami, Chandrasekhar. "A parallel polygon-clipping algorithm." Visual Computer 12, no. 3 (March 1996): 147–58. http://dx.doi.org/10.1007/bf01725102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Narayanaswami, Chandrasekhar. "A parallel polygon- clipping algorithm." Visual Computer 12, no. 3 (March 1, 1996): 147–58. http://dx.doi.org/10.1007/s003710050054.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Thornburg, Jonathan. "Algorithm 165 (correction): On polygon clipping." ACM SIGAPL APL Quote Quad 16, no. 2 (December 1985): 40. http://dx.doi.org/10.1145/380418.380430.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hong, Seong-Jin, and Ki-Chung Lee. "Development of Volleyball Match Analysis Program through Polygon Clipping Algorithm." Korean Journal of Sport Biomechanics 23, no. 1 (March 31, 2013): 45–51. http://dx.doi.org/10.5103/kjsb.2013.23.1.045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rappoport, Ari. "An efficient algorithm for line and polygon clipping." Visual Computer 7, no. 1 (January 1991): 19–28. http://dx.doi.org/10.1007/bf01994114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kui Liu, Yong, Xiao Qiang Wang, Shu Zhe Bao, Matej Gomboši, and Borut Žalik. "An algorithm for polygon clipping, and for determining polygon intersections and unions." Computers & Geosciences 33, no. 5 (May 2007): 589–98. http://dx.doi.org/10.1016/j.cageo.2006.08.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Skala, Václav. "An efficient algorithm for line clipping by convex polygon." Computers & Graphics 17, no. 4 (July 1993): 417–21. http://dx.doi.org/10.1016/0097-8493(93)90030-d.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Jin, Wen Yu, Yuan Yao, Wei Deng Chen, and Qing Xi Hu. "Boolean Operations Algorithm on Triangle Meshes for Modeling Bone Scaffold." Advanced Materials Research 421 (December 2011): 118–22. http://dx.doi.org/10.4028/www.scientific.net/amr.421.118.

Full text

Abstract:

Boolean operation is the key technology for modeling the bone scaffold. This paper proposes a Boolean operation algorithm based on triangle mesh model. It firstly voxelizes the mesh models based on project vector and octree, and classifies the vertices into inside, outside and surface type according to the position relationship between the vertex and the other mesh model’s voxel. Then the triangles can be easily classified based on the vertices class. Finally the Boolean model can be composed by the corresponding triangles of the Boolean operation. In order to obtain the intersection features well, it detects the intersection lines and gets the intersection polygons further, and then triangulates the polygon using the ear clipping method. This Boolean operation algorithm has been applied to the bone scaffold modeling and got good performance．

APA, Harvard, Vancouver, ISO, and other styles

10

Cao, Minghua, Heng Zhang, Changjie Zhou, Yi Sun, and Hui Yu. "Vector Circle Clipping Algorithm Based on Polygon Window of Hexagonal Grid System." Journal of Physics: Conference Series 1288 (August 2019): 012006. http://dx.doi.org/10.1088/1742-6596/1288/1/012006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Huang, Y. Q., and Y. K. Liu. "An algorithm for line clipping against a polygon based on shearing transformation." Computer Graphics Forum 21, no. 4 (December 2002): 683–88. http://dx.doi.org/10.1111/1467-8659.00626.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Simonson, Lucanus J. "Industrial strength polygon clipping: A novel algorithm with applications in VLSI CAD." Computer-Aided Design 42, no. 12 (December 2010): 1189–96. http://dx.doi.org/10.1016/j.cad.2010.06.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Lo Valvo, Ernesto, and Roberto Licari. "A More Efficient Method for Clustering Sheet Metal Shapes." Key Engineering Materials 344 (July 2007): 921–27. http://dx.doi.org/10.4028/www.scientific.net/kem.344.921.

Full text

Abstract:

The nesting of two-dimensional irregular shapes is a common problem which is frequently encountered by a number of industries where raw material has to be, as economically as possible, cut from a given stock sheet. A frequently recurring problem as far as cutting stock is concerned, is how to obtain the best nesting of some pieces of flat patterns which occupy minimalarea convex enclosure. The area of convex enclosure is related to the convex hull of the union of patterns which can be imagined as a large rubber band surrounding the set of all polygons. Our goal is to automatically obtain the smallest area convex shape containing all the patterns. As a matter of fact, Cheng and Rao have proposed an heuristic “stringy effect” procedure for clustering which follows a descending order of area of patterns. The “stringy effect” is able to put each new piece in a position which minimises the value of the distance between the centroid of each added piece and the centroid of the already formed cluster. The procedures till now shown in literature are quite complex. They make use of sliding techniques, and are not able to effectively work with relatively multiply-connected figures. In particular, the different procedures proposed are based on the No Fit Polygon computation of non-convex polygons, which often generates holes. This work is a proposal for a more efficient method, which can be used in heuristic procedure. In this paper a new procedure for the calculation of “No Fit Polygon” (NFP) of non-convex polygons is presented. Given two non-convex polygons, the algorithm is able to calculate their NFP very quickly and without any approximation by a polygon clipping method. By iterating this procedure with every polygon of our set, and positioning them using the “stringy effect” technique, it is so possible to obtain a convex shape that contains all the patterns, having the minimal area.

APA, Harvard, Vancouver, ISO, and other styles

14

Chandra, Sushil. "A Simple and Efficient Algorithm for Line and Polygon Clipping in 2-D Computer Graphics." International Journal of Computer Applications 127, no. 3 (October 15, 2015): 31–34. http://dx.doi.org/10.5120/ijca2015906352.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Raja, S. P. "Line and Polygon Clipping Techniques on Natural Images — A Mathematical Solution and Performance Evaluation." International Journal of Image and Graphics 19, no. 02 (April 2019): 1950012. http://dx.doi.org/10.1142/s0219467819500128.

Full text

Abstract:

The objective of this paper is to apply clipping techniques on natural images and to analyze the performance of various clipping algorithms in computer graphics. The clipping techniques used in this paper is Cohen–Sutherland line clipping, Liang–Barsky line clipping, Nicholl–Lee–Nicholl line clipping and Sutherland–Hodgman polygon clipping. The clipping algorithms are evaluated by using the three parameters: time complexity, space complexity and image accuracy. Previously, there is no performance evaluation on clipping algorithms done. Motivating by this factor, in this paper an evaluation of clipping algorithms is made. The novelty of this paper is to apply the clipping algorithms on natural images. It is justified that the above mentioned clipping algorithms outperform well on clipping the natural images.

APA, Harvard, Vancouver, ISO, and other styles

16

Sojka, E. "Two simple and efficient algorithms for Jordan sorting and polygon cutting and clipping." Computer Networks and ISDN Systems 29, no. 14 (October 1997): 1661–73. http://dx.doi.org/10.1016/s0169-7552(97)00081-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!