Practical segment intersection with finite precision output

Hobby, John D.

doi:10.1016/s0925-7721(99)00021-8

Cited by 68 publications

(58 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…en we nd all segment intersections and insert explicit intersection points using snap rounding as explained in [10]. ere is also a need to be no overlapping segments, but having all intersections explicit makes it trivial to nd them and remove duplicates.…”

Section: Building a Planar Subdivisionmentioning

confidence: 99%

A Method to Incorporate Floor Plan Constraints into Indoor Location Tracking: A Voronoi Approach

Hobby

Dashti

2018

Mobile Information Systems

Self Cite

View full text Add to dashboard Cite

Indoor localization has attracted a lot of research effort in recent years due to the explosion of indoor location-based service (LBS) applications. Incorporating map constraints into localization algorithms reduces the uncertainty of walking trajectories and enhances location accuracy. Suitable maps for computer-aided localization algorithms are not readily available, and hence most researchers working on localization solutions manually create maps for their specific localization scenarios. is paper presents a method of generating indoor maps suitable for localization algorithms from CAD floor plans. Our solution is scalable for massmarket LBS deployment. We also propose an adapted map-filtering algorithm that utilizes map information extracted from CAD floor plans. We evaluate the performance of our solution via real-world Wi-Fi RF measurements.

show abstract

Section: Building a Planar Subdivisionmentioning

confidence: 99%

A Method to Incorporate Floor Plan Constraints into Indoor Location Tracking: A Voronoi Approach

Hobby

Dashti

2018

Mobile Information Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Another technique that also is based on finite precision approximation is snap rounding (SP) [20], whose basic idea is to use some rounding method to convert an arbitrary precision arrangement of segments into a fixed-precision representation. Snap rounding has been used in GIS packages such as [3,7,19], but it can generate some inconsistencies by changing the topology -for example, see Figure 4.…”

Section: Roundoff Error Problems In Map Operationsmentioning

confidence: 99%

Fast exact parallel map overlay using a two-level uniform grid

Magalhães

Andrade

Franklin

et al. 2015

Proceedings of the 4th International ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data

View full text Add to dashboard Cite

We present EPUG-Overlay (Exact Parallel Uniform Grid Overlay), an algorithm to overlay two maps that is fast and parallel, has no roundoff errors, and is freely available. EPUG-Overlay combines several novel aspects. It represents coordinates with rational numbers, thereby ensuring exact computations with no roundoff errors and the ensuing sliver problems and topological impossibilities. For efficiency, EPUG-Overlay performs the map overlay in parallel, thereby utilizing the ubiquitous multicore architecture. Our application goes beyond merely using existing packages, which are inefficient when used in parallel on large problems. Indeed, overlaying two maps with 53,000,000 edges and 730,000 faces took only 322 elapsed seconds (plus 116 seconds for I/O) on a dual 8-core 3

show abstract

“…It is not a trivial task to deal with the intersections. A reliable implementation is needed to cope with the efficiency and limited precision of line segments [18][19][20] and arc segments [21][22][23][24][25][26][27]. A program algorithm with an O(n * (n − 3)) time complexity (closed curve) is offered below.…”

Section: Inputmentioning

confidence: 99%

A simple method for invalid loops removal of planar offset curves

Lai

Hung³

et al. 2005

Int J Adv Manuf Technol

View full text Add to dashboard Cite

The function of curve offset is of importance in the process of generating a machining tool-path. The robustness of curve offset is compact with reliable invalid loops removal algorithms. The traditional method based on interference detections in searching for all contact positions is a time consuming process and prone to misunderstanding. In order to improve such removal function, a new algorithm called the forward locus tracing method (FLTM) was introduced here. The FLTM searches for all intervals split by intersections of complicated planar curves directly and transforms 2D transversal intersection problems into 1D interval identifications. This proposed mapping process in FLTM may simplify the structure of tasks and be implemented by a computer program easily for CAD systems. Some examples with multiple loops were demonstrated and the results present considerable efficiency and reliability in the offset operation

show abstract

Practical segment intersection with finite precision output

Cited by 68 publications

References 0 publications

A Method to Incorporate Floor Plan Constraints into Indoor Location Tracking: A Voronoi Approach

A Method to Incorporate Floor Plan Constraints into Indoor Location Tracking: A Voronoi Approach

Fast exact parallel map overlay using a two-level uniform grid

A simple method for invalid loops removal of planar offset curves

Contact Info

Product

Resources

About