Analysis of the Nicholl-Lee-Nicholl Algorithm

Dévai, Frank

doi:10.1007/11424758_75

Cited by 3 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithms (Liang and Barsky, 1983) and (Dörr, 1990) are based on the direct intersection computation of a line with the polygon edges in the parametric form. Analy- sis of the Nicholl-Lee-Nicholl and Liang-Barsky algorithms was given in Devai (2005). Simple and robust line and line segment clipping algorithms in E 2 was described in Skala (2004Skala ( , 2005Skala ( , 2012Skala ( , 2020.…”

Section: Intersection With a Rectangular Areamentioning

confidence: 99%

“…Other proposed modifications of algorithms can be found in Bui (1999), Andreev and Sofianska (1991), Bao and Peng (1996), Devai (2005Devai ( , 2006Devai ( , 1998, Duvalenko et al (1990Duvalenko et al ( , 1993Duvalenko et al ( , 1996, Cai et al (2001), Day (1992aDay ( , 1992b, Evangeline and Anitha (2014), Kaijian et al (1990), Kodituwakku et al (2013), Kong and Yin (2001), Maillot (1992), Wei et al (2013), Slater and Barsky (1994), Ray (2012aRay ( , 2012bRay ( , 2014Ray ( , 2015, Li (2016), Singh and Lumar (2016), Dev and Saharan (2019).…”

Section: S-l-clip Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)

Skala¹

2023

Informatica

View full text Add to dashboard Cite

This contribution presents a brief survey of clipping and intersection algorithms in ${E^{2}}$ and ${E^{3}}$ with a nearly complete list of relevant references. Some algorithms use the projective extension of the Euclidean space and vector-vector operations, which support GPU and SSE use. This survey is intended to help researchers, students, and practitioners dealing with intersection and clipping algorithms.

show abstract