Live briefing
Everything about Segment tree
Computer science data structure
In computer science, the segment tree is a data structure used for finding the result of some associative function on a contiguous sub-array in just O(log n) time. Commonly, the data structure is used for summation, product, maximum or minimum. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Segment treeA 5-minute orientation
- Skim a recent paper: Individual tree segmentation and tree species classification in subtropical broadleaf forests using UAV-based LiDAR, hyperspectral, and ultrahigh-resolution RGB dataInfluential work since 2022
- Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
- Read the landmark paper: The 'segment length curse' in long tree-ring chronology development for palaeoclimatic studiesCited 601 times
- Go sideways: Interval treeA closely related topic
- Go sideways: Range treeA closely related topic
📖 Definitions
Noun A data structure that is used to store information about intervals (segments) and perform range queries, or queries on a set of intervals, in logarithmic time.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The 'segment length curse' in long tree-ring chronology development for palaeoclimatic studies
Adaptive clustering of airborne LiDAR data to segment individual tree crowns in managed pine forests
Covariation of axon initial segment location and dendritic tree normalizes the somatic action potential
Segment Based Decision Tree Induction With Continuous Valued Attributes
Separating Tree Photosynthetic and Non-Photosynthetic Components from Point Cloud Data Using Dynamic Segment Merging
KD-Box: Line-segment-based KD-tree for Interactive Exploration of Large-scale Time-Series Data
Analytical Modeling of Electromigration Failure for VLSI Interconnect Tree Considering Temperature and Segment Length Effects
A classification tree based modeling approach for segment related crashes on multilane highways
🆕 Influential since 2022
Individual tree segmentation and tree species classification in subtropical broadleaf forests using UAV-based LiDAR, hyperspectral, and ultrahigh-resolution RGB data
Nonlinear distortion correction for posterior eye segment optical coherence tomography with application to tree shrews
Enhanced Segment Tree Approach for Multi-Attribute Numerical Data in K-Anonymization for Data Privacy
UAV-Based High-Throughput Phenotyping to Segment Individual Apple Tree Row Based on Geometrical Features of Poles and Colored Point Cloud
Tree Topologies along a Tropical Line Segment
📚 Books worth reading
Computer NetworksAndrew S. Tanenbaum, John David Wetherall · 1981
Computational Linguistics and Intelligent Text ProcessingAlexander Gelbukh · 2003
The Dark DescentDavid G. Hartwell, Stephen King · 1987
Kingfisher illustrated animal encyclopediaDavid Burnie · 2000
The handbook of computational linguistics and natural language processingAlexander Clark, Chris Fox · 2010
Visual diagnosis in emergency and critical care medicineChristopher P. Holstege · 2006
Information Processing in Medical ImagingJames C. Gee · 2013
AfterEllen Datlow, Terri Windling · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Interval tree In computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap…
- Range tree In computer science, a range tree is an ordered tree data structure to hold a list of points. It allows all points within a given range to be reported…
- Quadtree A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are…
- Persistent data structure In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when…
- K-d tree Wikimedia Commons has media related to k-d trees. In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure…
- Range query (computer science) In computer science, the range query problem consists of efficiently answering several queries regarding a given interval of elements within an array.…
- Disjoint-set data structure In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection…
- Priority search tree In computer science, a priority search tree is a tree data structure for storing points in two dimensions. It was originally introduced by Edward M. McCreight…