From c0b89ac5bfb90835ef01573267020e42d4fe070c Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?J=C3=B6rg=20Frings-F=C3=BCrst?= Date: Sun, 23 Aug 2015 12:17:05 +0200 Subject: Imported Upstream version 1.8.0 --- gamut/gamut.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) mode change 100644 => 100755 gamut/gamut.c (limited to 'gamut/gamut.c') diff --git a/gamut/gamut.c b/gamut/gamut.c old mode 100644 new mode 100755 index 02b18dc..dd4f43b --- a/gamut/gamut.c +++ b/gamut/gamut.c @@ -16,7 +16,7 @@ */ /* - The gamut boundary is comuted using a variation of + The gamut surface is computed using a variation of Jan Morovic's Segment Maximum approach. The variations are: @@ -24,7 +24,7 @@ so that approximately the same detail is kept on the gamut surface. Multiple direction vectors at each point are retained. The resultant points are used to create the overal convex - jull, but in an adaptive, non-linearly scaled radial space, + hull, but in an adaptive, non-linearly scaled radial space, that allows for convexity in the PCS result. */ @@ -3628,7 +3628,7 @@ gamut *s * * For accellerating the vector intersect code, this isn't * so fabulous, and a general unconstrained BSP tree would - * be better. To address this, an orhogonal element to the + * be better. To address this, an orthogonal element to the * radial BSP's is provided in the radius squared range * of each set of elements below a BSP node. */ -- cgit v1.2.3