UNPKG

romgrk-2d-geometry

Version:

Javascript library for 2d geometry

91 lines (81 loc) 2.82 kB
import { Box } from '../classes/Box'; import type { Point } from '../classes/Point' import { IntervalTree } from '../data_structures/interval-tree'; type AnyShape = { box: Box } /** * Class representing a planar set - a generic container with ability to keep and retrieve shapes and * perform spatial queries. Planar set is an extension of Set container, so it supports * Set properties and methods */ export class PlanarSet extends Set { index: IntervalTree /** * Create new instance of PlanarSet * @param shapes - array or set of geometric objects to store in planar set * Each object should have a <b>box</b> property */ constructor(shapes?: AnyShape[]) { super(shapes); this.index = new IntervalTree(); this.forEach(shape => this.index.insert(shape)) } /** * Add new shape to planar set and to its spatial index.<br/> * If shape already exist, it will not be added again. * This happens with no error, it is possible to use <i>size</i> property to check if * a shape was actually added.<br/> * Method returns planar set object updated and may be chained * @param shape - shape to be added, should have valid <i>box</i> property */ add(shape: AnyShape) { const size = this.size; super.add(shape); // size not changed - item not added, probably trying to add same item twice if (this.size > size) { this.index.insert(shape.box as any, shape); } return this; // in accordance to Set.add interface } /** * Delete shape from planar set. Returns true if shape was actually deleted, false otherwise * @param shape - shape to be deleted */ delete(shape: AnyShape) { const deleted = super.delete(shape); if (deleted) { this.index.remove(shape.box, shape); } return deleted; } /** * Clear planar set */ clear() { super.clear(); this.index = new IntervalTree(); } /** * 2d range search in planar set.<br/> * Returns array of all shapes in planar set which bounding box is intersected with query box * @param box - query box */ search(box: Box) { return this.index.search(box); } /** * Point location test. Returns array of shapes which contains given point * @param point - query point */ hit(point: Point) { const box = new Box(point.x - 1, point.y - 1, point.x + 1, point.y + 1); return this.index.search(box as any).filter((shape) => point.on(shape)); } /** * Returns svg string to draw all shapes in planar set */ svg() { return [...(this as any)].reduce<string>((acc, shape) => acc + shape.svg(), ''); } }