Quick algorithm for reconstructing line object adjacency relations

DOI10.3724/SP.J.1087.2008.00245zbMATH Open1172.68685OpenAlexW2316728034MaRDI QIDQ3185482FDOQ3185482

Authors: Mingxue Liao, Zhihua Fan, Xiaoxin He 

Publication date: 26 October 2009

Published in: Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3724/sp.j.1087.2008.00245

Recommendations

• An optimal algorithm for intersecting line segments in the plane
• scientific article; zbMATH DE number 1174631
• An efficient \(k\) nearest neighbors searching algorithm for a query line.
• Topologically sweeping an arrangement
• A simple algorithm for determining the envelope of a set of lines

zbMATH Keywords

algorithm analysisadjacency relationline objecthashed-bucket sorting

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cited In (2)

• Title not available (Why is that?)
• On the average time complexity of computation with random partition

This page was built for publication: Quick algorithm for reconstructing line object adjacency relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3185482)