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

Skala, Václav

doi:10.15388/23-infor508

Cited by 6 publications

(6 citation statements)

References 163 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…line-convex polyhedron intersection if intersections' points are computed using the parametric form of the given line; however, instead of the separation line two orthogonal planes, which define the clipped line p have to be used, similarly as in [19]. For a deeper study of intersection algorithms, a reader is advised to read "A brief survey of intersection and clipping algorithms" [31].…”

Section: Discussionmentioning

confidence: 99%

“…Thanks also belong to the anonymous reviewers, as their comments and hints helped to improve this paper and to several authors of recently published relevant papers [31] for sharing their views and hints provided.…”

Section: Acknowledgmentmentioning

confidence: 99%

“…Algorithms for a line and line segment intersection computation with the convex polygon in E 2 and convex polyhedron in E 3 are key parts of many geometrical packages, CAD and GIS systems, etc. An extensive survey of intersection and clipping algorithms can be found in [31]. Fundamental algorithms have been described in many textbooks, see Appendix.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Robust line-convex polygon intersection computation in E² using projective space representation

Skala

2023

MG&V

Self Cite

View full text Add to dashboard Cite

This paper describes modified robust algorithms for a line clipping by a convex polygon in E2 and a convex polyhedron in E3. The proposed algorithm is based on the Cyrus-Beck algorithm and uses homogeneous coordinates to increase the robustness of computation. The algorithm enables computation fully in the projective space using the homogeneous coordinates and the line can be given in the projective space, in general. If the result can remain in projective space, no division operation is needed. It supports the use of vector-vector operations, SSE/AVX instructions, and GPU.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Acknowledgmentmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Robust line-convex polygon intersection computation in E² using projective space representation

Skala

2023

MG&V

Self Cite

View full text Add to dashboard Cite

show abstract

“…where x E = [1/3, 1/3 : 1] T is the equal energy point position, [0, 1 : 1] T is the green color position, and means projective equivalency. Details on projective geometric algebra use can be found in [16,32,49] and intersection computation in [50]. It is important to note that the positions discussed in the context of chromaticity are given in homogeneous coordinates.…”

Section: Cie-xy Color Systemmentioning

confidence: 99%

Multispectral Image Generation from RGB Based on WSL Color Representation: Wavelength, Saturation, and Lightness

Skala

2023

Computers

Self Cite

View full text Add to dashboard Cite

Image processing techniques are based nearly exclusively on RGB (red–green–blue) representation, which is significantly influenced by technological issues. The RGB triplet represents a mixture of the wavelength, saturation, and lightness values of light. It leads to unexpected chromaticity artifacts in processing. Therefore, processing based on the wavelength, saturation, and lightness should be more resistant to the introduction of color artifacts. The proposed process of converting RGB values to corresponding wavelengths is not straightforward. In this contribution, a novel simple and accurate method for extracting the wavelength, saturation, and lightness of a color represented by an RGB triplet is described. The conversion relies on the known RGB values of the rainbow spectrum and accommodates variations in color saturation.

show abstract

“…Determining interacted regions between molecular models is similar to performing Boolean intersection operations on 3D grid models in computer science, which aligns with the molecular 3D isosurface grid models generated using the marching cube (MC) algorithm. , The essence of 3D Boolean intersection operations lies in efficiently executing spatial triangle intersection tests. − However, processing based on 3D grid models tends to lead to complexity and unreliability . In contrast, planar line segments have fewer geometric features than spatial triangles, simplifying planar polygon Boolean intersection operation.…”

Section: Introductionmentioning

confidence: 99%

Accurately Computing the Interacted Volume of Molecules over Their 3D Mesh Models

Li,

Lv,

Liu

et al. 2024

J. Chem. Inf. Model.

View full text Add to dashboard Cite

For quickly predicting the rational arrangement of catalysts and substrates, we previously proposed a method to calculate the interacted volumes of molecules over their 3D point cloud models. However, the nonuniform density in molecular point clouds may lead to incomplete contours in some slices, reducing the accuracy of the previous method. In this paper, we propose a twostep method for more accurately computing molecular interacted volumes. First, by employing a prematched mesh slicing method, we layer the 3D triangular mesh models of the electrostatic potential isosurfaces of two molecules globally, transforming the volume calculation into finding the intersecting areas in each layer. Next, by subdividing polygonal edges, we accurately identify intersecting parts within each layer, ensuring precise calculation of interacted volumes. In addition, we present a concise overview for computing intersecting areas in cases of multiple contour intersections and for improving computational efficiency by incorporating bounding boxes at three stages. Experimental results demonstrate that our method maintains high accuracy in different experimental data sets, with an average relative error of 0.16%. On the same experimental setup, our average relative error is 0.07%, which is lower than the previous algorithm's 1.73%, improving the accuracy and stability in calculating interacted volumes.

show abstract

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

Cited by 6 publications

References 163 publications

Robust line-convex polygon intersection computation in E² using projective space representation

Robust line-convex polygon intersection computation in E² using projective space representation

Multispectral Image Generation from RGB Based on WSL Color Representation: Wavelength, Saturation, and Lightness

Accurately Computing the Interacted Volume of Molecules over Their 3D Mesh Models

Contact Info

Product

Resources

About