Distance Trisector of a Segment and a Point

スポンサーリンク

概要

• 論文の詳細を見る

• Motivated by the work of Asano et al. [1], we consider the distance trisector problem and zone diagram considering segments in the plane as the input geometric objects. As the most basic case, we first consider the pair of curves (distance trisector curves) trisecting the distance between a point and a line, as shown in Figure 1. This is a natural extension of the bisector curve (that is a parabola) of a point and a line. In this paper, we show that these trisector curves C1 and C2 exist and are unique.

著者

• Tokuyama Takeshi

  Graduate School Of Information Science Tohoku University

• Chun Jinhee

  Graduate School Of Information Science Tohoku University

• Okada Yuji

  Graduate School of Information Sciences, Tohoku University

関連論文

• Distance Trisector of a Segment and a Point
• Voronoi Diagrams with Respect to Criteria on Vision Information
• Quasi-Norms for a Double Sequence
• On Detecting Digital Line Components in a Binary Image
• Reconstructing sets from distances given by graphs (コンピュテーション)
• Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization
• Quantum Algorithms for Intersection and Proximity Problems
• Quantum Computation in Computational Geometry
• Combinatorics on Arrangements and Parametric Matroids : A Bridge between Computational Geometry and Combinatorial Optimization(Special Issue on Algorithm Engineering : Surveys)
• On Properties of a Set of Global Roundings Associated with Clique Connection of Graphs
• Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication
• DS-1-11 An Algorithm for Optimally Locating Baselines using Quad Decomposition

もっと見る 閉じる

スポンサーリンク