Academic literature on the topic 'Polygon clipping algorithm'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.
Journal articles on the topic "Polygon clipping algorithm"
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 textNarayanaswami, Chandrasekhar. "A parallel polygon-clipping algorithm." Visual Computer 12, no. 3 (March 1996): 147–58. http://dx.doi.org/10.1007/bf01725102.
Full textNarayanaswami, Chandrasekhar. "A parallel polygon- clipping algorithm." Visual Computer 12, no. 3 (March 1, 1996): 147–58. http://dx.doi.org/10.1007/s003710050054.
Full textThornburg, 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 textHong, 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 textRappoport, 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 textKui 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 textSkala, 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 textJin, 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 textCao, 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 textDissertations / Theses on the topic "Polygon clipping algorithm"
Liu, Ran. "A comparison of Ear Clipping and a new Polygon Triangulation Algorithm." Thesis, University of Gävle, Department of Industrial Development, IT and Land Management, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-7238.
Full textThe simple polygon triangulation is an classic problem in computational geometry and the techniques are widely used in many field. Many existing techniques have short running time but are hard to implement, some are easy to achieve, however, the output quality always bad and are time consuming. This paper propose a diagonal inserting algorithm which is easy to implement and can enhance the final quality. This presented algorithm was implemented and compared with the ear clipping technique which is simple to carry out and long-standing in the triangulation history. These two algorithms were tested on various polygons and an analysis concerning the quality, speed and the standard deviation of the output triangles` size is done.
Alghamdi, Areej. "An Algorithm for Clipping Polygons of Large Geographical Data." Thesis, University of Oregon, 2017. http://hdl.handle.net/1794/22790.
Full textDaněk, Tomáš. "Analýza algoritmů booleovských operací nad obecnými polygony." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-235449.
Full textPeng, Wei Jye, and 彭維杰. "An Efficient Algorithm for Polygon Clipping." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/32163351255194692187.
Full text淡江大學
資訊工程學系
84
Computer graphic has became a new and an important discipline as thedevelopment of computer. It was applied to many areas since the inexpensiveand powerful hardware were available. "Computer Graphic" could be defined as"To produce and process graphic and image by computer". A graphic could beexplained and interpreted as numeric data. Computer graphic can convert alarge quantity of data to bar chart, fan chart or any other useful graph,therefore users can get a clear and understandable information quickly. The cutting and shearing are very important in computer graphic. Intraditionally, the beam tracing is done by polygon cutting. By removing thehiding line to produce the high quality 3D graph. The cutting of polygon isalso useful in the Multiprocessor Raytracing System. It can partition a 3Dscene to several objects, then send those objects to proper processor toincrease the speed of rendering. The polygon cutting is used to display which parts of the input polygonwere located in the range of another polygon. The display area is so called"window". In most system such as the Macintosh and the Xwindow, theirdisplay window is limited to rectangle. We will discussion the quadranglecutting algorithm for arbitrary polygon in this paper. There are many algorithms have proposed to cut arbitrary polygon byquadrangle now. The very first and the widely use algorithm is presented bySutherland-Hodgman [SUTH74b] and Liang- Barsky [LIAN84]. Basically, there aretwo polygon-cutting methods. The first method use the rectangle to cut eachedge of the input polygon. The other method is to use the each edge ofrectangle to cut the input polygon individually. The LB algorithm is theformer method and the SH algorithm belongs to the latter method. Each onehas its own advantages but their same disadvantage is these algorithms willwaste time to compute intersections that are not in the window. A newalgorithm called case by case method is presented in this paper will testfirst if an intersection was located in a window, then it will decide if itis needed to do further calculation. The unnecessarily execution time couldbe saved. Polygon is composed by many segments. So, we may take thepolygon-cutting as composed of cutting by many segments. We can have betterperformance by improving the speed of segment-cutting to improve the speedof polygon-cutting. Our new algorithm presented here can be used in computeraided design (CAD), virtual reality (VR), and real-time computer animationsystem. It will still provide a good result even without using a high speedworkstation.
Lin, Tzung-Shing, and 林宗興. "A Study of Efficient Algorithm For 2-D Polygon Clipping." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/05638718390605002943.
Full text國立臺灣科技大學
工程技術研究所
81
Line and polygon clipping is one of the important parts in 2-D computer graphics.All of the algorithms pertaining to them need mass MUL/DIV operations to execute , and it takes much of microprocessor time to execute the MUL /DIV operation . As a result , performances of these algorithms become an important factor. To solve the problem , beside the hardware improvement, more efficient algorithms are still to be researched for reduc- ing the time of MUL/DIV process . SH algorithm , issued by Sutherland-Hodgman (SH) in 1974 , uses cross product method to distinguish the position of point which lies on the left side or the right side of segment. This particular algorithm needs a lot of MUL/DIV operation to carry out the polygon clipping. In 1983, Liang-Barsky(LB) introduced the parameter line equation method,its execution time is almost half of that of SH algorithm.However,both SH and LB algorithms have the same restriction which can only be used to clip convex polygon. The application is severely restricted accordingly . Based on a structure of parameter line equation,an algorithm to clip convex and concave polygon is proposed . The algorithm not only improves the disadvantage of SH and LB algorithms,but also has the same execution speed as the LB algorithm.In general , the performance of the proposed algorithm is shown be better then a variety of algorithms .
Ρούντζας, Αθανάσιος. "Ψηφιακός επεξεργαστής και γραφικά υπολογιστών." Thesis, 2008. http://nemertes.lis.upatras.gr/jspui/handle/10889/1592.
Full text-
Chang, Shu-Hsiang, and 張舒翔. "Algorithms for Polygon Clipping by a Plane or Polygon." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/21781316190285408504.
Full text國立臺灣大學
機械工程學研究所
92
In the algorithms of hidden surface removal, the generation of shadows, and clipping by the window, we often encounter the problems of polygon clipping by a plane or polygon. The SH algorithm has been already proposed by Sutherland and Hodgman to solve the problems of polygon clipping by a plane and even been applied in other fields. But it still has two following defects. First, it has to decide whether each of the intersections of the cutting plane and the polygon is inward or outward. Second, it doesn’t describe how to handle the vertices that are just located on the cutting plane in detail. On the other hand, Greiner’s algorithm has also been proposed by Greiner to solve the problems of polygon clipping by a polygon. While Greiner’s algorithm has a simpler data structure and better efficiency, we have an idea that its abilities of dealing with degenerate cases, the data structure, and the sub-routine of adding intersections into the original list of vertices can be improved further. Here we will propose two algorithms that can figure out the above problems of both the SH and Greiner’s algorithms, respectively. The time efficiency of the former algorithm to the SH algorithm ranges from 1.15 to 1.35, while that of the latter to Greiner’s algorithm comes up to 1.32. So we can come to a conclusion that both our algorithms not only improve but also prove to be faster.
Sun, Chen-Yen, and 孫俊彥. "The Research of The Clipping Algorithm for Concave Polygons and Discussions with Hidden-Surface Removal Algorithms." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/53538487427037790015.
Full text國立臺灣大學
機械工程學系
86
The first task for the 3-dimensions object rendering in the computer graphics, is to determine the graphic order of the visible and the hidden surfaces. In this research we will discuss several prevailing hidden-surface removal algorithm among recent computer graphics studies. With the presentation of dynamic simulation of computer rendering, we are going to compare three methods: Binary Space-Partitioning Tree Algorithm, Feudal Priority Algorithm, and Object Priority Algorithm, of their characteristics, efficacy and defects. All of the current-used high-speed real-time rendering algorithms face the problem of clipping polygon with correctness, but the traditional clipping algorithms will make mistakes when clipping concave polygons. We start from inquiring the intersections generated by the polygon clipping, then to studying the spatial relationship between intersection and polygon, finally to determine the properties of the intersection. The effectiveness and correctness of this concave polygon clipping algorithm is, capable of its dealing with other cases of concave polygon clipping, which other algorithms cannot solve. We will at the same time study the Z-Buffer Algorithm, discussing its efficiency and defect, and trying to present a new operation. In addition to this, we will compare the Z-Buffer Algorithm with other hidden-surfaces removal algorithms, of their various properties and suitability.
Book chapters on the topic "Polygon clipping algorithm"
Huang, Wenjun. "Line Clipping Algorithm of Affine Transformation for Polygon." In Intelligent Computing Theories, 55–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39479-9_7.
Full textSharma, Mugdha, and Jasmeen Kaur. "An Improved Polygon Clipping Algorithm Based on Affine Transformation." In Advances in Intelligent Systems and Computing, 783–92. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2517-1_75.
Full textSkala, Vaclav. "A Novel Line Convex Polygon Clipping Algorithm in E2 with Parallel Processing Modification." In Computational Science and Its Applications – ICCSA 2021, 3–15. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86976-2_1.
Full textMei, Gang, John C. Tipper, and Nengxiong Xu. "Ear-Clipping Based Algorithms of Generating High-Quality Polygon Triangulation." In Lecture Notes in Electrical Engineering, 979–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34531-9_105.
Full text"6 Control parallel versus data parallel polygon clipping." In Algorithms for Parallel Polygon Rendering, 112–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51394-9_6.
Full textConference papers on the topic "Polygon clipping algorithm"
Puri, Satish, and Sushil K. Prasad. "Output-Sensitive Parallel Algorithm for Polygon Clipping." In 2014 43nd International Conference on Parallel Processing (ICPP). IEEE, 2014. http://dx.doi.org/10.1109/icpp.2014.33.
Full textFeng, Shuangheng, and Xuedong Du. "A polygon clipping algorithm based on series coding technique." In 2010 2nd International Conference on Future Computer and Communication. IEEE, 2010. http://dx.doi.org/10.1109/icfcc.2010.5497767.
Full textZhang, Mingjun, and Chaman L. Sabharwal. "An efficient implementation of parametric line and polygon clipping algorithm." In the 2002 ACM symposium. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/508791.508945.
Full textTang, Liang-liang, and Yuan-jun He. "A Linear Time Algorithm for the Line Clipping against Concave Polygon." In 2009 International Conference on Information Engineering and Computer Science. ICIECS 2009. IEEE, 2009. http://dx.doi.org/10.1109/iciecs.2009.5364626.
Full textYang, Dingding, Shiqiang Chen, Qingwen Yang, and Yue Hu. "A clipping algorithm on vector graphics based on non-intersect polygon boundary." In 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC). IEEE, 2016. http://dx.doi.org/10.1109/itnec.2016.7560482.
Full textMcGrew, J. Michael. "Removal of artifacts from polygons clipped using the Sutherland-Hodgman polygon clipping algorithm (abstract and figure only)." In the 19th annual conference. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/327164.328841.
Full textZhang, Qinghai. "A Hybrid Framework for Free-Surface Flows With Irregular Solid Boundaries." In ASME 2010 29th International Conference on Ocean, Offshore and Arctic Engineering. ASMEDC, 2010. http://dx.doi.org/10.1115/omae2010-20594.
Full textLizhi Xie, Peng Li, Mingquan Zhou, and Xuesong Wang. "An clipping general polygons in regular girds algorithm base on successive encoding." In 2010 International Conference on Computer Application and System Modeling (ICCASM 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccasm.2010.5619427.
Full textPuri, Satish, and Sushil K. Prasad. "A Parallel Algorithm for Clipping Polygons with Improved Bounds and a Distributed Overlay Processing System Using MPI." In 2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid). IEEE, 2015. http://dx.doi.org/10.1109/ccgrid.2015.43.
Full text