An optimal algorithm for intersecting line segments in the plane (Q4302817): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/jacm/ChazelleE92, #quickstatements; #temporary_batch_1731508824982 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/147508.147511 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015696135 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/ChazelleE92 / rank | |||
Normal rank | |||
Latest revision as of 16:23, 13 November 2024
scientific article; zbMATH DE number 622300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for intersecting line segments in the plane |
scientific article; zbMATH DE number 622300 |
Statements
An optimal algorithm for intersecting line segments in the plane (English)
0 references
13 November 1994
0 references
geometrical computations
0 references
computer graphics
0 references
windowing
0 references
clipping
0 references
hidden- surface removal
0 references
computational geometry
0 references
line arrangements
0 references
