scientific article; zbMATH DE number 432982

MaRDI QIDQ3139119zbMATH OpenFDO

Authors Franz Aurenhammer, Gerd Stöckl

Publication date 6 November 1994

zbMATH Keywords

data structureabstract Voronoi diagramretrievalintersecting line segments

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete geometry (52C99)

Recommendations

• Searching for segments with largest relative overlap
• Finding similar regions in many sequences
• Finding segmentations of sequences
• Segment intersection searching problems in general settings
• Segment intersection searching problems in general settings
• Pattern matching for sets of segments
• Pattern matching for sets of segments
• Algorithms for the optimal identification of segment neighborhoods
• Dynamic orthogonal segment intersection search
• An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score

Cited in

(2)

• Searching for segments with largest relative overlap
• Overlap matching

This page was built for publication:

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