Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Geometric algorithms
An Entity of Type:
Concept
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org:8891
Property
Value
dbo:
wikiPageID
702582
(xsd:integer)
dbo:
wikiPageRevisionID
906011471
(xsd:integer)
dbp:
wikiPageUsesTemplate
dbt
:Commons_category
rdf:
type
skos
:Concept
rdfs:
label
Geometric algorithms
(en)
skos:
broader
dbc
:Combinatorial_algorithms
dbc
:Computational_geometry
skos:
prefLabel
Geometric algorithms
(en)
prov:
wasDerivedFrom
wikipedia-en
:Category:Geometric_algorithms?oldid=906011471&ns=14
owl:
sameAs
dbc
:Geometric_algorithms
is
dbo:
wikiPageWikiLink
of
dbr
:Proximity_problems
dbr
:Mesh_generation
dbr
:Monotone_polygon
dbr
:Nearest_neighbor_search
dbr
:Prune_and_search
dbr
:Visibility_polygon
dbr
:Bounding_volume
dbr
:HyperFun
dbr
:Delaunay_tessellation_field_estimator
dbr
:Delaunay_triangulation
dbr
:List_of_numerical_computational_geometry_topics
dbr
:Criss-cross_algorithm
dbr
:Geometric_algorithms
dbr
:Geometric_design
dbr
:Geometric_modeling
dbr
:Geometric_primitive
dbr
:Geometric_spanner
dbr
:Nesting_algorithm
dbr
:Rectilinear_Steiner_tree
dbr
:Geometric_median
dbr
:Bounding_sphere
dbr
:Bowyer–Watson_algorithm
dbr
:Minkowski_addition
dbr
:Cone_algorithm
dbr
:Bentley–Ottmann_algorithm
dbr
:Line–line_intersection
dbr
:Steiner_tree_problem
dbr
:Closest_pair_of_points_problem
dbr
:Fréchet_distance
dbr
:Function_representation
dbr
:Point_in_polygon
dbr
:Sweep_line_algorithm
dbr
:Marching_triangles
dbr
:CGAL
dbr
:Katchalski-Katzir_algorithm
dbr
:Largest_empty_rectangle
dbr
:Largest_empty_sphere
dbr
:Line_fitting
dbr
:Linear_programming
dbr
:Line–plane_intersection
dbr
:Line–sphere_intersection
dbr
:Lloyd's_algorithm
dbr
:Local_feature_size
dbr
:Minimum_bounding_box_algorithms
dbr
:Bregman_divergence
dbr
:Centroidal_Voronoi_tessellation
dbr
:Fan_triangulation
dbr
:Gradient_pattern_analysis
dbr
:Hierarchical_RBF
dbr
:JTS_Topology_Suite
dbr
:Wiener_connector
dbr
:Bitonic_tour
dbr
:Rectangle_packing
dbr
:Watchman_route_problem
dbr
:Boolean_operations_on_polygons
dbr
:Greedy_geometric_spanner
dbr
:Midpoint_circle_algorithm
dbr
:Ramer–Douglas–Peucker_algorithm
dbr
:Rotating_calipers
dbr
:Minimum_bounding_box
dbr
:Minimum_bounding_rectangle
dbr
:Minkowski_Portal_Refinement
dbr
:Velocity_obstacle
dbr
:Visibility_(geometry)
dbr
:Weighted_Voronoi_diagram
dbr
:Shoelace_formula
dbr
:Euclidean_shortest_path
dbr
:Planar_straight-line_graph
dbr
:Space_partitioning
dbr
:Fixed-radius_near_neighbors
dbr
:Gilbert–Johnson–Keerthi_distance_algorithm
dbr
:Gilbert–Pollack_conjecture
dbr
:Möller–Trumbore_intersection_algorithm
dbr
:Vertex_enumeration_problem
dbr
:Symmetrization_methods
dbr
:Multiple_line_segment_intersection
dbr
:Surface-to-surface_intersection_problem
dbr
:Star-shaped_polygon
dbr
:Spatial_database
dbr
:Stencil_jumping
dbr
:Visvalingam–Whyatt_algorithm
is
dcterms:
subject
of
dbr
:Proximity_problems
dbr
:Mesh_generation
dbr
:Monotone_polygon
dbr
:Nearest_neighbor_search
dbr
:Prune_and_search
dbr
:Visibility_polygon
dbr
:Bounding_volume
dbr
:HyperFun
dbr
:Delaunay_tessellation_field_estimator
dbr
:Delaunay_triangulation
dbr
:List_of_numerical_computational_geometry_topics
dbr
:Criss-cross_algorithm
dbr
:Geometric_algorithms
dbr
:Geometric_design
dbr
:Geometric_modeling
dbr
:Geometric_primitive
dbr
:Geometric_spanner
dbr
:Nesting_algorithm
dbr
:Rectilinear_Steiner_tree
dbr
:Geometric_median
dbr
:Bounding_sphere
dbr
:Bowyer–Watson_algorithm
dbr
:Minkowski_addition
dbr
:Cone_algorithm
dbr
:Bentley–Ottmann_algorithm
dbr
:Line–line_intersection
dbr
:Steiner_tree_problem
dbr
:Closest_pair_of_points_problem
dbr
:Fréchet_distance
dbr
:Function_representation
dbr
:Point_in_polygon
dbr
:Sweep_line_algorithm
dbr
:Marching_triangles
dbr
:CGAL
dbr
:Katchalski-Katzir_algorithm
dbr
:Largest_empty_rectangle
dbr
:Largest_empty_sphere
dbr
:Line_fitting
dbr
:Linear_programming
dbr
:Line–plane_intersection
dbr
:Line–sphere_intersection
dbr
:Lloyd's_algorithm
dbr
:Local_feature_size
dbr
:Minimum_bounding_box_algorithms
dbr
:Bregman_divergence
dbr
:Centroidal_Voronoi_tessellation
dbr
:Fan_triangulation
dbr
:Gradient_pattern_analysis
dbr
:Hierarchical_RBF
dbr
:JTS_Topology_Suite
dbr
:Wiener_connector
dbr
:Bitonic_tour
dbr
:Rectangle_packing
dbr
:Watchman_route_problem
dbr
:Boolean_operations_on_polygons
dbr
:Greedy_geometric_spanner
dbr
:Midpoint_circle_algorithm
dbr
:Ramer–Douglas–Peucker_algorithm
dbr
:Rotating_calipers
dbr
:Minimum_bounding_box
dbr
:Minimum_bounding_rectangle
dbr
:Minkowski_Portal_Refinement
dbr
:Velocity_obstacle
dbr
:Visibility_(geometry)
dbr
:Weighted_Voronoi_diagram
dbr
:Shoelace_formula
dbr
:Euclidean_shortest_path
dbr
:Planar_straight-line_graph
dbr
:Space_partitioning
dbr
:Fixed-radius_near_neighbors
dbr
:Gilbert–Johnson–Keerthi_distance_algorithm
dbr
:Gilbert–Pollack_conjecture
dbr
:Möller–Trumbore_intersection_algorithm
dbr
:Vertex_enumeration_problem
dbr
:Symmetrization_methods
dbr
:Multiple_line_segment_intersection
dbr
:Surface-to-surface_intersection_problem
dbr
:Star-shaped_polygon
dbr
:Spatial_database
dbr
:Stencil_jumping
dbr
:Visvalingam–Whyatt_algorithm
is
skos:
broader
of
dbc
:Researchers_in_geometric_algorithms
dbc
:Mesh_generation
dbc
:Geometric_intersection
dbc
:Curve_fitting
dbc
:Computational_topology
dbc
:Computer-aided_design
dbc
:Geographic_information_systems
dbc
:Computer_graphics_algorithms
dbc
:Graph_drawing
dbc
:Digital_geometry
dbc
:Convex_hull_algorithms
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 3.0 Unported License