de.thaw.comb

Interface Segment

All Superinterfaces:

Comparable<Segment>, NodePair, Vector

All Known Implementing Classes:

AbstractSegment, AbstractSegment.Fragment, SourceSegment

public interface Segment
extends NodePair, Comparable<Segment>, Vector

An ordered tuple of two defined points in the euclidian plane. Instances may or may not have relationships with actual points or ways in the OSM planet database. Instances are always indirectly a part of a Dataset.

Field Summary

Fields inherited from interface de.thaw.comb.util.Vector

FULL_CIRCLE, RIGHT_ANGLE, SEMI_CIRCLE

Method Summary

Modifier and Type	Method and Description
void	addBestLeftMatch(Segment bestMatch)
void	addBestRightMatch(Segment bestMatch)
void	analyse(Analyser visitor)
Node	end()
Node	findPerpendicularFoot(Node node)
SourceSegment	root()
boolean	shouldIgnore() Whether this Segment was split into two new Segments.
void	splitAt(Node node, SplitQueueListener sink) Split this Segment at the given node.
void	splitCloseParallels(SplitQueueListener sink)
Collection<Segment>	splitTargets()
Node	start()

Methods inherited from interface de.thaw.comb.NodePair

distance, midPoint, other

Methods inherited from interface java.lang.Comparable

compareTo

Methods inherited from interface de.thaw.comb.util.Vector

aligned, bearing, distance, easting, isAligned, northing, relativeBearing, reversed

Method Detail

root

SourceSegment root()

shouldIgnore

boolean shouldIgnore()

Whether this Segment was split into two new Segments.

The SPLITTEN algorithm is defined to remove the original segment that was split into two parts from the collection of line parts to be split. Keeping the original would only duplicate work as the splitting is based on nodes, and both of the original's nodes are also present in its two parts after it was split. Rather than removing (which would likely be expensive), we introduce a simple flag to skip any line part that has already been split.

See Also:

splitAt(Node,SplitQueueListener)

start

Node start()

end

Node end()

splitTargets

Collection<Segment> splitTargets()

findPerpendicularFoot

Node findPerpendicularFoot(Node node)

splitCloseParallels

void splitCloseParallels(SplitQueueListener sink)

splitAt

void splitAt(Node node,
             SplitQueueListener sink)

Split this Segment at the given node. This Segment will be marked as having been split so that it will be ignored by future processing steps. The split will be reported to the split queue listener so that the two fragments created by the split can again be used for splitting.

See Also:

shouldIgnore()

analyse

void analyse(Analyser visitor)

addBestLeftMatch

void addBestLeftMatch(Segment bestMatch)

addBestRightMatch

void addBestRightMatch(Segment bestMatch)