1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
// SPDX-License-Identifier: MIT
//
// Copyright (c) 2025 Alexandre Severino
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
// pub struct BigRationalKernel;
// impl Kernel2 for BigRationalKernel {
// type FT = CgarRational;
// type Point2 = Point<CgarRational, 2>;
// type Segment2 = Segment<CgarRational, 2>;
// type Vector2 = Vector<CgarRational, 2>;
// #[inline]
// fn orient2d(a: &Self::Point2, b: &Self::Point2, c: &Self::Point2) -> Self::FT {
// orient::<CgarRational, 2>(&[a.clone(), b.clone(), c.clone()])
// }
// #[inline]
// fn are_equal2(a: &Self::Point2, b: &Self::Point2) -> bool {
// are_equal(a, b)
// }
// #[inline]
// fn are_collinear2(a: &Self::Point2, b: &Self::Point2, c: &Self::Point2) -> bool {
// are_collinear(a, b, c)
// }
// #[inline]
// fn is_point_on_segment2(p: &Self::Point2, s: &Self::Segment2) -> bool {
// is_point_on_segment(p, s)
// }
// }
// impl Kernel3 for BigRationalKernel
// where
// Point3<CgarRational>: PointOps<CgarRational, 3>,
// {
// type FT = CgarRational;
// type Point3 = Point<CgarRational, 3>;
// type Segment3 = Segment<CgarRational, 3>;
// type Vector3 = Vector<CgarRational, 3>;
// #[inline]
// fn orient3d(
// a: &Self::Point3,
// b: &Self::Point3,
// c: &Self::Point3,
// d: &Self::Point3,
// ) -> Self::FT {
// let ab = (&b.clone() - a).as_vector();
// let ac = (&c.clone() - a).as_vector();
// let ad = (&d.clone() - a).as_vector();
// ab.cross(&ac).dot(&ad)
// }
// #[inline]
// fn are_equal3(a: &Self::Point3, b: &Self::Point3) -> bool {
// are_equal(a, b)
// }
// #[inline]
// fn are_collinear3(a: &Self::Point3, b: &Self::Point3, c: &Self::Point3) -> bool {
// are_collinear(a, b, c)
// }
// #[inline]
// fn is_point_on_segment3(p: &Self::Point3, s: &Self::Segment3) -> bool {
// is_point_on_segment(p, s)
// }
// }