question: tests if a point is inside the circle defined by the triangle with vertices a , b , c oriented counter-clockwise . this test uses simple double-precision arithmetic , and thus may not be robust . concode_field_sep PlaceHolder placeHolder concode_field_sep DD triAreaDDSlow concode_elem_sep boolean isInCircleCC concode_elem_sep boolean isInCircleRobust concode_elem_sep DD triAreaDDFast concode_elem_sep boolean isInCircleNormalized concode_elem_sep double triArea concode_elem_sep boolean isInCircleDDSlow concode_elem_sep boolean isInCircleDDNormalized concode_elem_sep void checkRobustInCircle concode_elem_sep boolean isInCircleDDFast
target: boolean function ( Coordinate arg0 , Coordinate arg1 , Coordinate arg2 , Coordinate arg3 ) { boolean loc0 = ( arg0 . x * arg0 . x + arg0 . y * arg0 . y ) * triArea ( arg1 , arg2 , arg3 ) - ( arg1 . x * arg1 . x + arg1 . y * arg1 . y ) * triArea ( arg0 , arg2 , arg3 ) + ( arg2 . x * arg2 . x + arg2 . y * arg2 . y ) * triArea ( arg0 , arg1 , arg3 ) - ( arg3 . x * arg3 . x + arg3 . y * arg3 . y ) * triArea ( arg0 , arg1 , arg2 ) > 0 ; return loc0 ; }