Matches in SemOpenAlex for { <https://semopenalex.org/work/W2241912687> ?p ?o ?g. }
Showing items 1 to 81 of
81
with 100 items per page.
- W2241912687 abstract "This thesis addresses several problems in the facility location sub-area of computational geometry. Let S be a set of n points in the plane. We derive algorithms for approximating S by a step function curve of size k < n, i.e., by an x-monotone orthogonal polyline R with k < n horizontal segments. We use the vertical distance to measure the quality of the approximation, i.e., the maximum distance from a point in S to the horizontal segment directly above or below it. We consider two types of problems: min-e, where the goal is to minimize the error for a given number of horizontal segments k and min-#, where the goal is to minimize the number of segments for a given allowed error e. After O(n) preprocessing time, we solve instances of the latter in O(min{ k log n, n}) time per instance. We can then solve the former problem in O(min{n², nk log n}) time. Both algorithms require O(n) space. The second contribution is a heuristic for the min-e problem that computes a solution within a factor of 3 of the optimal error for k segments, or with at most the same error as the k-optimal but using 2k − 1 segments. Furthermore, experiments on real data show even better results than what is guaranteed by the theoretical bounds. Both approximations run in O(n log n) time and O(n) space. Then, we present an exact algorithm for the weighted version of this problem that runs in O( n²) time and generalize the heuristic to handle weights at the expense of an additional log n factor. At this point, a randomized algorithm that runs in O(n log² n) expected time for the unweighted version is presented. It easily generalizes to the weighted case, though at the expense of an additional log n factor. Finally, we treat the maximin problem and present an O(n³ log n) solution to the problem of finding the furthest separating line through a set of weighted points. We conclude with solutions to the “obnoxious” wedge problem: an O(n² log n) algorithm for the general case of a wedge with its apex on the boundary of the convex hull of S and an O(n²) algorithm for the case of the apex of a wedge coming from the input set S." @default.
- W2241912687 created "2016-06-24" @default.
- W2241912687 creator A5015621968 @default.
- W2241912687 creator A5025937522 @default.
- W2241912687 date "2011-01-01" @default.
- W2241912687 modified "2023-09-26" @default.
- W2241912687 title "Minimax and maximin fitting of geometric objects to sets of points" @default.
- W2241912687 cites W1502200255 @default.
- W2241912687 cites W1981507524 @default.
- W2241912687 cites W2099669488 @default.
- W2241912687 cites W2116598609 @default.
- W2241912687 cites W2117862225 @default.
- W2241912687 cites W2139919335 @default.
- W2241912687 hasPublicationYear "2011" @default.
- W2241912687 type Work @default.
- W2241912687 sameAs 2241912687 @default.
- W2241912687 citedByCount "0" @default.
- W2241912687 crossrefType "journal-article" @default.
- W2241912687 hasAuthorship W2241912687A5015621968 @default.
- W2241912687 hasAuthorship W2241912687A5025937522 @default.
- W2241912687 hasConcept C11413529 @default.
- W2241912687 hasConcept C114614502 @default.
- W2241912687 hasConcept C118615104 @default.
- W2241912687 hasConcept C126255220 @default.
- W2241912687 hasConcept C14036430 @default.
- W2241912687 hasConcept C149728462 @default.
- W2241912687 hasConcept C173801870 @default.
- W2241912687 hasConcept C177264268 @default.
- W2241912687 hasConcept C199360897 @default.
- W2241912687 hasConcept C2524010 @default.
- W2241912687 hasConcept C2834757 @default.
- W2241912687 hasConcept C28719098 @default.
- W2241912687 hasConcept C29123130 @default.
- W2241912687 hasConcept C33923547 @default.
- W2241912687 hasConcept C41008148 @default.
- W2241912687 hasConcept C78458016 @default.
- W2241912687 hasConcept C86803240 @default.
- W2241912687 hasConceptScore W2241912687C11413529 @default.
- W2241912687 hasConceptScore W2241912687C114614502 @default.
- W2241912687 hasConceptScore W2241912687C118615104 @default.
- W2241912687 hasConceptScore W2241912687C126255220 @default.
- W2241912687 hasConceptScore W2241912687C14036430 @default.
- W2241912687 hasConceptScore W2241912687C149728462 @default.
- W2241912687 hasConceptScore W2241912687C173801870 @default.
- W2241912687 hasConceptScore W2241912687C177264268 @default.
- W2241912687 hasConceptScore W2241912687C199360897 @default.
- W2241912687 hasConceptScore W2241912687C2524010 @default.
- W2241912687 hasConceptScore W2241912687C2834757 @default.
- W2241912687 hasConceptScore W2241912687C28719098 @default.
- W2241912687 hasConceptScore W2241912687C29123130 @default.
- W2241912687 hasConceptScore W2241912687C33923547 @default.
- W2241912687 hasConceptScore W2241912687C41008148 @default.
- W2241912687 hasConceptScore W2241912687C78458016 @default.
- W2241912687 hasConceptScore W2241912687C86803240 @default.
- W2241912687 hasLocation W22419126871 @default.
- W2241912687 hasOpenAccess W2241912687 @default.
- W2241912687 hasPrimaryLocation W22419126871 @default.
- W2241912687 hasRelatedWork W1498095290 @default.
- W2241912687 hasRelatedWork W1567158140 @default.
- W2241912687 hasRelatedWork W1575344150 @default.
- W2241912687 hasRelatedWork W1608900095 @default.
- W2241912687 hasRelatedWork W1964787778 @default.
- W2241912687 hasRelatedWork W2042172282 @default.
- W2241912687 hasRelatedWork W2047239272 @default.
- W2241912687 hasRelatedWork W2073116298 @default.
- W2241912687 hasRelatedWork W2085751730 @default.
- W2241912687 hasRelatedWork W2099217816 @default.
- W2241912687 hasRelatedWork W2125961713 @default.
- W2241912687 hasRelatedWork W2132011326 @default.
- W2241912687 hasRelatedWork W2141285107 @default.
- W2241912687 hasRelatedWork W2142959308 @default.
- W2241912687 hasRelatedWork W2338095277 @default.
- W2241912687 hasRelatedWork W2407517109 @default.
- W2241912687 hasRelatedWork W2883269584 @default.
- W2241912687 hasRelatedWork W2952188679 @default.
- W2241912687 hasRelatedWork W3165080458 @default.
- W2241912687 hasRelatedWork W2583131596 @default.
- W2241912687 isParatext "false" @default.
- W2241912687 isRetracted "false" @default.
- W2241912687 magId "2241912687" @default.
- W2241912687 workType "article" @default.