Matches in SemOpenAlex for { <https://semopenalex.org/work/W2030844359> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W2030844359 abstract "This thesis introduces Epsilon Geometry, a framework for the development of robust geometric algorithms using inaccurate primitives. Epsilon Geometry is based on a very general model of imprecise computations, which includes floating-point and rounded-integer arithmetic as special cases. The algorithms in this framework produce exact solutions for perturbed versions of their input and return a bound on the size of these implicit perturbations.The thesis begins with a formal description of the Epsilon Geometry framework. It introduces the notions of an epsilon predicate, a geometric predicate that can be satisfied by a perturbed version of its arguments; and a critical distance, the size of the perturbation required to make an epsilon predicate true. It also introduces epsilon and delta boxes, the implementations of these mathematical concepts as computer programs. The thesis describes some general rules for turning mathematical lemmas about epsilon predicates and critical distances into implementations of epsilon and delta boxes. Next, it presents a basic set of two-dimensional geometric predicates that are used for all of the algorithms in the sequel.The second half of the thesis examines how Epsilon Geometry can be applied to various geometric objects and algorithms in the plane. It defines the notions of an $varepsilon$-convex polygon, a polygon that can be made convex by perturbing each of its vertices by $varepsilon$ or less; and a ($-varepsilon)$-convex polygon, a polygon that remains convex even if its vertices are all displaced in arbitrary directions by a distance of $varepsilon$ or less. The thesis develops robust algorithms for testing point inclusion in both kinds of polygons, and for testing a polygon's degree of convexity. Finally, the thesis investigates the existence of approximate hulls for sets of points. It proves that for every point set there exists a ($-varepsilon$)-convex polygon H such that every point of the set is at most 4$varepsilon$ away from H, and it describes robust algorithms for computing such hulls." @default.
- W2030844359 created "2016-06-24" @default.
- W2030844359 creator A5001511641 @default.
- W2030844359 creator A5048473992 @default.
- W2030844359 creator A5082851874 @default.
- W2030844359 date "1989-01-01" @default.
- W2030844359 modified "2023-10-17" @default.
- W2030844359 title "Epsilon geometry: building robust algorithms from imprecise computations" @default.
- W2030844359 cites W1987099710 @default.
- W2030844359 cites W2000306582 @default.
- W2030844359 cites W2020492229 @default.
- W2030844359 cites W2023538518 @default.
- W2030844359 cites W2048401959 @default.
- W2030844359 cites W2056501879 @default.
- W2030844359 cites W2082135154 @default.
- W2030844359 cites W2177163667 @default.
- W2030844359 cites W2443862921 @default.
- W2030844359 cites W2752853835 @default.
- W2030844359 doi "https://doi.org/10.1145/73833.73857" @default.
- W2030844359 hasPublicationYear "1989" @default.
- W2030844359 type Work @default.
- W2030844359 sameAs 2030844359 @default.
- W2030844359 citedByCount "169" @default.
- W2030844359 countsByYear W20308443592012 @default.
- W2030844359 countsByYear W20308443592013 @default.
- W2030844359 countsByYear W20308443592014 @default.
- W2030844359 countsByYear W20308443592015 @default.
- W2030844359 countsByYear W20308443592016 @default.
- W2030844359 countsByYear W20308443592017 @default.
- W2030844359 countsByYear W20308443592018 @default.
- W2030844359 countsByYear W20308443592019 @default.
- W2030844359 countsByYear W20308443592020 @default.
- W2030844359 countsByYear W20308443592021 @default.
- W2030844359 countsByYear W20308443592022 @default.
- W2030844359 crossrefType "proceedings-article" @default.
- W2030844359 hasAuthorship W2030844359A5001511641 @default.
- W2030844359 hasAuthorship W2030844359A5048473992 @default.
- W2030844359 hasAuthorship W2030844359A5082851874 @default.
- W2030844359 hasConcept C11413529 @default.
- W2030844359 hasConcept C2524010 @default.
- W2030844359 hasConcept C29123130 @default.
- W2030844359 hasConcept C33923547 @default.
- W2030844359 hasConcept C41008148 @default.
- W2030844359 hasConcept C45374587 @default.
- W2030844359 hasConceptScore W2030844359C11413529 @default.
- W2030844359 hasConceptScore W2030844359C2524010 @default.
- W2030844359 hasConceptScore W2030844359C29123130 @default.
- W2030844359 hasConceptScore W2030844359C33923547 @default.
- W2030844359 hasConceptScore W2030844359C41008148 @default.
- W2030844359 hasConceptScore W2030844359C45374587 @default.
- W2030844359 hasLocation W20308443591 @default.
- W2030844359 hasOpenAccess W2030844359 @default.
- W2030844359 hasPrimaryLocation W20308443591 @default.
- W2030844359 hasRelatedWork W1572523360 @default.
- W2030844359 hasRelatedWork W1605074373 @default.
- W2030844359 hasRelatedWork W2044214361 @default.
- W2030844359 hasRelatedWork W2051727958 @default.
- W2030844359 hasRelatedWork W2051922990 @default.
- W2030844359 hasRelatedWork W2356203074 @default.
- W2030844359 hasRelatedWork W2386767533 @default.
- W2030844359 hasRelatedWork W2390931758 @default.
- W2030844359 hasRelatedWork W2555373106 @default.
- W2030844359 hasRelatedWork W2887599639 @default.
- W2030844359 isParatext "false" @default.
- W2030844359 isRetracted "false" @default.
- W2030844359 magId "2030844359" @default.
- W2030844359 workType "article" @default.