On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0925-7721(95)00022-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4213071546 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56288896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filling polyhedral molds. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologically sweeping an arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity and construction of many faces in arrangements of lines and of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union of fat wedges and separating a collection of segments by a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better lower bounds on detecting affine and spherical degeneracies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fat Triangles Determine Linearly Many Holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTATIONAL GEOMETRY COLUMN 22 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the free space for a robot moving amidst fat obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The visibility diagram: A data structure for visibility problems and motion planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:47, 24 May 2024

scientific article
Language Label Description Also known as
English
On a class of \(O(n^ 2)\) problems in computational geometry
scientific article

    Statements

    Identifiers