Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann

functions.hpp File Reference

Detailed Description

Contains additional functions used in segment intersection problems.

Definition in file functions.hpp.

Go to the source code of this file.

Data Structures

struct event_compare< node >

struct vertical_compare< Node >

Typedefs

typedef cgl< double > Geometry

typedef Geometry::line_type line_type

typedef Geometry::point_type point_type

typedef Geometry::coord_type coord_type

Functions

std::pair< bool, point_type > intersection (const line_type &l1, const line_type &l2)

Function that finds the intersection of two line segments, or returns false if two line segments do no intersect.

Code Documentation generated Using Doxygen


Data Structures
struct	event_compare< node >
struct	vertical_compare< Node >
Typedefs
typedef cgl< double >	Geometry
typedef Geometry::line_type	line_type
typedef Geometry::point_type	point_type
typedef Geometry::coord_type	coord_type
Functions
std::pair< bool, point_type >	intersection (const line_type &l1, const line_type &l2)
	Function that finds the intersection of two line segments, or returns false if two line segments do no intersect.