/* E D A R S . C

* BRL-CAD

*

* Copyright (c) 1996-2026 United States Government as represented by

* the U.S. Army Research Laboratory.

*

* This program is free software; you can redistribute it and/or

* modify it under the terms of the GNU Lesser General Public License

* version 2.1 as published by the Free Software Foundation.

*

* This program is distributed in the hope that it will be useful, but

* WITHOUT ANY WARRANTY; without even the implied warranty of

* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU

* Lesser General Public License for more details.

*

* You should have received a copy of the GNU Lesser General Public

* License along with this file; see the file named COPYING for more

* information.

*/

/** @file mged/edars.c

*

*/

#include "common.h"

#include <math.h>

#include <string.h>

#include "vmath.h"

#include "nmg.h"

#include "raytrace.h"

#include "rt/geom.h"

#include "wdb.h"

#include "./mged.h"

#include "./sedit.h"

#include "./mged_dm.h"

/**

* find which vertex of an ARS is nearest *the ray from "pt" in the

* viewing direction (for vertex selection in MGED)

*/

void

find_ars_nearest_pnt(

int *crv,

int *col,

struct rt_ars_internal *ars,

point_t pick_pt,

vect_t dir)

{

size_t i, j;

int closest_i=0, closest_j=0;

fastf_t min_dist_sq=MAX_FASTF;

RT_ARS_CK_MAGIC(ars);

for (i=0; i<ars->ncurves; i++) {

for (j=0; j<ars->pts_per_curve; j++) {

fastf_t dist_sq;

dist_sq = bg_distsq_line3_pnt3(pick_pt, dir, &ars->curves[i][j*3]);

if (dist_sq < min_dist_sq) {

min_dist_sq = dist_sq;

closest_i = i;

closest_j = j;

}

}

}

*crv = closest_i;

*col = closest_j;

}

/*

* Local Variables:

* mode: C

* tab-width: 8

* indent-tabs-mode: t

* c-file-style: "stroustrup"

* End:

* ex: shiftwidth=4 tabstop=8

*/