This article was reviewed by member(s) of WikiProject Articles for creation. The project works to allow users to contribute quality articles and media files to the encyclopedia and track their progress as they are developed. To participate, please visit the
project page for more information.Articles for creationWikipedia:WikiProject Articles for creationTemplate:WikiProject Articles for creationAfC articles
This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of
computers,
computing, and
information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join
the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of
Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join
the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
"ordered by priority and by a key value" → it's unclear whether these are dimensions or additional properties of points, maybe ", one dimension corresponding to priority and the other to a key for the point"?
The operations supported should be described already in the lead, like "A query returns all points with keys in a given range [min_key, max_key] and priority below a given threshold max_priority.". This also makes it clear how keys are a dimension, with a linear order. The Description section can then focus on how it is implemented (how it stores those points).
Does the structure not support any modifying operations? If yes, then this should be mentioned in the lead, since "extension of priority queue" suggests otherwise.
"each nodes represent a point" → "each node represents exactly one point"?
"the lowest priority" → add "among nodes in its subtree"?
This article was reviewed by member(s) of WikiProject Articles for creation. The project works to allow users to contribute quality articles and media files to the encyclopedia and track their progress as they are developed. To participate, please visit the
project page for more information.Articles for creationWikipedia:WikiProject Articles for creationTemplate:WikiProject Articles for creationAfC articles
This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of
computers,
computing, and
information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join
the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of
Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join
the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
"ordered by priority and by a key value" → it's unclear whether these are dimensions or additional properties of points, maybe ", one dimension corresponding to priority and the other to a key for the point"?
The operations supported should be described already in the lead, like "A query returns all points with keys in a given range [min_key, max_key] and priority below a given threshold max_priority.". This also makes it clear how keys are a dimension, with a linear order. The Description section can then focus on how it is implemented (how it stores those points).
Does the structure not support any modifying operations? If yes, then this should be mentioned in the lead, since "extension of priority queue" suggests otherwise.
"each nodes represent a point" → "each node represents exactly one point"?
"the lowest priority" → add "among nodes in its subtree"?
