_GEO_TYPENAME box2d_to_lwgeom box3d_make box3d_out box3d_to_lwgeom cart_to_lwpoint distance_point2d gbox_make gbox_out geo_as_ewkb geo_as_ewkt geo_as_geojson geo_as_hexewkb geo_as_text geo_as_wkt geo_collect_garray geo_copy geo_equals geo_extract_elements geo_from_ewkb geo_from_geojson geo_from_text geo_geo_n geo_is_empty geo_is_unitary geo_makeline_garray geo_num_geos geo_num_points geo_out geo_pointarr geo_points geo_reverse geo_same geo_serialize geo_set_srid geo_srid geo_transform geo_transform_pipeline geo_typename geog_area geog_centroid geog_distance geog_dwithin geog_from_hexewkb geog_from_lwgeom geog_in geog_intersects geog_length geog_perimeter geog_serialize geog_to_geom geogpoint_make2d geogpoint_make3dz geography_centroid_from_mline geography_centroid_from_mpoly geography_centroid_from_wpoints geography_valid_type geom_array_union geom_azimuth geom_boundary geom_buffer geom_centroid geom_contains geom_convex_hull geom_covers geom_difference2d geom_disjoint2d geom_distance2d geom_distance3d geom_dwithin2d geom_dwithin3d geom_from_hexewkb geom_in geom_intersection2d geom_intersection2d_coll geom_intersects2d geom_intersects3d geom_length geom_min_bounding_radius geom_perimeter geom_relate_pattern geom_serialize geom_shortestline2d geom_shortestline3d geom_spatialrel geom_to_geog geom_touches geom_unary_union geompoint_make2d geompoint_make3dz GEOS2POSTGIS gserialized_is_point gserialized_is_poly itree_pip_contains itree_pip_covers itree_pip_intersects line_interpolate_point line_locate_point line_numpoints line_point_n line_substring lonlat_to_cart lwgeom_collect_points lwgeom_line_interpolate_point lwgeom_mec lwgeom_mec_supported_type MAXBOX3DLEN MAXGBOXLEN mec_circle2 mec_circle3 mec_circle3_safe mec_inside mec_welzl meos_call_geos2 meos_point_in_polygon PG_PARSER_ERROR PGIS_FP_TOLERANCE POSTGIS2GEOS postgis_valid_typmod spheroid_init_from_srid

mec_welzl() static Circle mec_welzl ( POINT2D *  P, int  n  ) static Iterative Welzl algorithm for the minimum enclosing circle. Equivalent to the recursive Welzl algorithm but uses constant stack space. The three nested loops correspond to the three levels of recursion (boundary set size 0, 1, 2). Despite appearing O(n^3), the expected runtime is O(n) with random shuffling. Parameters [in] P Array of points (must be shuffled beforehand) [in] n Number of points Precondition n >= 1