computational-geometryintersectioncgal
Intersection of CGAL::Iso_rectangle_2 and CGAL::Ray_2
There is a function Object intersection(Type1<Kernel> obj1, Type2<Kernel> obj2) in CGAL which will return an object, representing intersection of two given objects of different possible types. It is said, that intersection of CGAL::Iso_rectangle_2 (rectangle with sides parallel to the x and y axis) and CGAL::Ray_2 (oriented ray outgoing from given point) is either CGAL::Point_2 or CGAL::Segment_2 (just point or segment).
And what about the case when ray intersects rectangle in two points? Cannot see anything about it in the manual.
Solution
Answered by Sebastien Loriot in cgal-discuss mailing list:
The iso_rectangle is considered as full so that what you call the two point case is the segment one.
- Catmull-Rom interpolation on SVG Paths
- Intersection between AABB and a capsule (swept sphere)
- Compute minimum area convex k-gon in 2d
- Difference between algorithm solution and MATLAB CVX solution in Graphical LASSO?
- k-way triangle set intersection and triangulation
- How to find the intersection point of a 3D curve and a 3D surface?
- Extending a line segment to fit into a bounding box
- Find visibility polyhedron given a point inside it
- While finding count of points inside some shape using KD-Tree, do we need to check areas intersection, or just compare depth-appropriate properties?
- Check if a 3D point lies inside a 3D platonic solid?
- How to check a point is inside an ellipsoid with orientation?
- In solidworks, is there a way to get the direction cosines of a surface normal?
- How to find overlapping area of convex coplanar polygons in 3D?
- Compensate IMU pan/tilt
- derive (approximate) rotation transform matrix (numpy) on a unit sphere given a mapping of vectors (n=12)
- Find two furthest points in a point set in linear time (2-approximation algorithm)
- Difference between quadtree and kd-tree
- How do I compute, in O(n) time, a convex hull of a set of points which are sorted by x-coordinate?
- Check if a point projected on a line segment is not outside it
- Segment Intersection
- How to convert spherical geometry to ellipsoid geometry c++ vertex generation
- Closest edge to a rectangle in a plane of rectangles
- What is most efficient way to find the intersection of a line and a circle in python?
- Initializing Half-edge data structure from vertices
- How to draw a circle in GNU Octave
- Calculate the outline of an abstract shape with holes
- What is the algorithm for finding the center of a circle from three points?
- Fast footpoint computation over polygonal lines in MATLAB
- Merging Geodataframe Polygons to Meet Population Threshold in Python
- Given a set of bounding boxes in an 2D space, group them into rows