Loading...
Search for: geometry
0.01 seconds
Total 788 records

    Weak visibility queries of line segments in simple polygons and polygonal domains

    , Article International Journal of Computer Mathematics ; 2017 , Pages 1-18 ; 00207160 (ISSN) Nouri Bygi, M ; Ghodsi, M ; Sharif University of Technology
    Taylor and Francis Ltd  2017
    Abstract
    In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or (Formula presented.)) inside a given polygon (Formula presented.). Our first algorithm runs in simple polygons and needs (Formula presented.) time and (Formula presented.) space in the preprocessing phase to report (Formula presented.) of any query line segment pq in time (Formula presented.). We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with (Formula presented.) pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs (Formula presented.) time and (Formula presented.) space in the... 

    Weak visibility queries of line segments in simple polygons and polygonal domains

    , Article International Journal of Computer Mathematics ; Volume 95, Issue 4 , 2018 , Pages 721-738 ; 00207160 (ISSN) Nouri Bygi, M ; Ghodsi, M ; Sharif University of Technology
    Taylor and Francis Ltd  2018
    Abstract
    In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or WVP(pq)) inside a given polygon P. Our first algorithm runs in simple polygons and needs O(n3 log n) time and O(n3) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log n + |WVP(pq)|).. We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with h ≥ 1 pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs O(n2 log n) time and O(n2) space in the preprocessing phase and WVP(pq) in query time of O(nh’ log n + k), in which h’ is an output sensitive parameter... 

    Possibilistic Art (PoArt), an Approach based on Mind Geometry for Digital Media

    , Article 5th Iranian Conference on Signal Processing and Intelligent Systems, ICSPIS 2019, 18 December 2019 through 19 December 2019 ; 2019 ; 9781728153506 (ISBN) Asasian Kolur, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    This paper, in the domain of digital media, introduces the theoretical basis of possibilistic art. It models the bases of visual art in the atmosphere of possibilistic thought and the fuzzy geometry by introducing meaningful forms and introduces a way for recording and displaying emotional-behavioral responses of artist in the visualcomputational space. Finally, as a function of presented concepts, the paper introduces a semi-algorithm for meaningful deformation. This article, by representation of a method based on the eastern thinking and a computational thinking of the west, make a step in the way of eliminating the theoretic and instrumental shortages of visual arts of Iran in the grounds... 

    Improved recovery of analysis sparse vectors in presence of prior information

    , Article IEEE Signal Processing Letters ; Volume 26, Issue 2 , 2019 , Pages 222-226 ; 10709908 (ISSN) Daei, S ; Haddadi, F ; Amini, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    In this letter, we consider the problem of recovering analysis-sparse signals from under-sampled measurements when some prior information about the support is available. We incorporate such information in the recovery stage by suitably tuning the weights in a weighted ℓ1-analysis optimization problem. Indeed, we try to set the weights such that the method succeeds with minimum number of measurements. For this purpose, we exploit the upper-bound on the statistical dimension of a certain cone to determine the weights. Our numerical simulations confirm that the introduced method with tuned weights outperforms the standard ℓ1-analysis technique. © 1994-2012 IEEE  

    An adaptive CPR-AMG based linear solver for simulating geometrically complicated and fractured reservoirs

    , Article Society of Petroleum Engineers - Abu Dhabi International Petroleum Exhibition and Conference 2020, ADIP 2020, 9 through 12 November ; 2020 Mohajeri, S ; Eslahi, R ; Bakhtiari, M ; Alizadeh, A ; Zeinali, M ; Madani, M ; Rajabi, H ; Sharifi, E ; Mortezazadeh, E ; Mahdavifar, Y ; Sharif University of Technology
    Society of Petroleum Engineers  2020
    Abstract
    A great deal of computational power and time is necessary for simulating highly heterogeneous fractured reservoirs with complex geometry; the efficiency of these computations is a major subject especially in large-scale heterogeneous and fractured reservoirs. So, simulating large scale, complex and fractured reservoirs with both minimum time and maximum accuracy is the scope of current work. The BiCG-Stabilized solver preconditioned by CPR-AAMG has been developed to achieve acceptable results of high efficiency and robustness for large heterogeneous fractured Black-Oil models. The solver's efficiency is demonstrated in an Iranian fractured field model with heterogeneity. As an observation,... 

    Supramolecular assembly through intermolecular n → π∗ interactions through a coordinated perrhenate formed: Via superoxidation of Re(i) to Re(vii) in the formation of substituted Re(CO)3complexes bearing Diimine ligands

    , Article CrystEngComm ; Volume 22, Issue 39 , September , 2020 , Pages 6448-6452 Kia, R ; Taghavi, T ; Raithby, P. R ; Sharif University of Technology
    Royal Society of Chemistry  2020
    Abstract
    We report the structural, spectroscopic, and computational studies of two new Re(i) tricarbonyl complexes bearing 2,3,6,7-tetraphenyl-1,4,5,8-tetraazaphenanthrene (Ph4TAP) and 4,5-diazafluoren-9-one (dafone) having a coordinated perrhenate group obtained via in situ superoxidation of Re(i) to Re(vii); intramolecular and intermolecular n → π∗ interactions are dominant and stabilize the molecular geometry and crystal packing. This journal is © The Royal Society of Chemistry  

    Wave propagation in a three-dimensional half-space with semi-infinite irregularities

    , Article Waves in Random and Complex Media ; 2021 ; 17455030 (ISSN) Daneshyar, A ; Sotoudeh, P ; Ghaemian, M ; Sharif University of Technology
    Taylor and Francis Ltd  2021
    Abstract
    Dynamic analysis of problems with complex geometries requires utilization of numerical methods. To completely capture the effects of seismic wave propagation in a system, one must consider the structure or irregularity within its encompassing half-space. Correct consideration of half-space in a numerical model is important specially when it comes to cases where the half-space contains semi-infinite irregularities. In this study, a generalized numerical methodology is presented for dynamic analysis of a half-space with semi-infinite irregularities. The methodology is first verified through comparison with analytical solution of known problems. Then the method is employed to solve the dynamic... 

    Image quality equations for focused transducer in circular photoacoustic computed tomography

    , Article 29th Iranian Conference on Electrical Engineering, ICEE 2021, 18 May 2021 through 20 May 2021 ; 2021 , Pages 917-921 ; 9781665433655 (ISBN) Hakakzadeh, S ; Kavehvash, Z ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2021
    Abstract
    In this paper, we divide the imaging geometry of a photoacoustic computed tomography (PACT) structure that have a circular geometry and have focused transducers of positive or negative focus, into different zones of varying resolution. With using the presented analysis, it is possible to find the maximum range in which the system resolution is at its best value, according to the device specifications. The following equations are used to find the blind spot angles of the system for each source point inside the chamber. These are important for two reasons: the first is that the user can calculate the range in which the imaging system has the best quality by entering the specifications of his... 

    Imprints of gravitational millilensing on the light curve of gamma-ray bursts

    , Article Astrophysical Journal ; Volume 922, Issue 1 , November , 2021 ; 0004637X (ISSN) Kalantari, Z ; Ibrahim, A ; Reza Rahimi Tabar, M ; Rahvar, S ; Sharif University of Technology
    IOP Publishing Ltd  2021
    Abstract
    In this work, we search for signatures of gravitational millilensing in gamma-ray bursts (GRBs) in which the source-lens-observer geometry produces two images that manifest in the GRB light curve as superimposed peaks with identical temporal variability (or echoes), separated by the time delay between the two images. According to the sensitivity of our detection method, we consider millilensing events due to point-mass lenses in the range of 105 - 107 M o˙ at lens redshift about half that of the GRB, with a time delay on the order of 10 s. Current GRB observatories are capable of resolving and constraining this lensing scenario if the above conditions are met. We investigated the Fermi/GBM... 

    Patellofemoral Joint Biomechanics

    , Article Patellofemoral Disorders: Diagnosis and Treatment ; 2005 , Pages 37-53 ; 9780470011164 (ISBN); 0470850116 (ISBN); 9780470850114 (ISBN) Amis, A. A ; Bull, A. M. J ; Farahmand, F ; Senavongse, W ; Shih, Y. F ; Sharif University of Technology
    Wiley Blackwell  2005

    Investigating Path Simplification Problems

    , M.Sc. Thesis Sharif University of Technology Emadi, Ghobad (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    A basic technique in data reduction is to approximate a collection of data by another collection of smaller size. Then, the resulted data are easier to be processed or maintained. An example of such large scale data is the ordered sequence of n points describing a path or a region boundary. We are given a sequence of points p , p , ..., p , and we consider the 1 2 n problem of approximating these points by a path with k < n line segments which error of this path is not greater than special value. Various criterions are defined to compute the path simplification error.This problem can be used in GIS, Image Processing and Computer Graphics problems. In this thesis, we consider special case... 

    Minimum Link Navigation

    , M.Sc. Thesis Sharif University of Technology Davari, Mohammad Javad (Author) ; Zarei, Ali Reza (Supervisor)
    Abstract
    Finding a path between two specified points is one of the most common problem in computational geometry. The minimum-link path problem is in this category. The minimum-link path between two points is the path between these points with the minimum number of segments. Minimum-link paths have application in areas such as computer graphic, geographic information systems, robotics, image processing, cryptography and VLSI.In this thesis we study variations of the minimum link path problem. Specifically we consider the constrained minimum-link paths in which the path must passes through some given
    regions. We detected a flaw in a previously presented algorithm and propose a method to fix this... 

    Shortest Path to View a Point in General Polygons

    , M.Sc. Thesis Sharif University of Technology Narenji Sheshkalani, Ali (Author) ; Ghodsi, Mohammad (Supervisor) ; Abam, Mohammad Ali (Co-Advisor)
    Abstract
    We consider two variations of shortest paths problem inside a poly-gon. In the first variation, we want to find a shortest path from asource to view a destination inside a polygon with holes. We pro-pose two algorithms for this problem with the time complexity of O (hn log n) and O(n log n) in which the second one is optimal. In the second variation, we want to place a center policeman inside a sim-ple polygon so that the longer of the two shortest paths from two existing guards to the visibility polygon of the center policeman is minimized. We propose an algorithm for this problem with the time complexity of O(n 3)  

    A Novel Approach for Reconstructing Paths Using Visibility Graph

    , M.Sc. Thesis Sharif University of Technology Javan, Majid (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    Visibility graph is a graph that comprises information about visibility of a set of objects in 2 or 3-dimensional space. By constructing this graph with respect to conditions of environment one can answer questions like minimum Euclidean distance. Inverse of this procedure is required too; i.e. knowing geometrical structure of objects and information about their visibility we want to guess their location in space and, as the saying goes, reconstruct the environment. For example some methods to reconstruct specific polygons knowing which vertices each vertex sees is proposed. In this dissertation we try to reconstruct a 2-dimensional environment that only has two x-monotone paths (chains)  

    Recognition and Reconstruction of Visibility Gragh in Special Cases

    , M.Sc. Thesis Sharif University of Technology Yazdani Ghooshchi, Mina (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    For a simple polygon in the plane, the visibility graph is a graph whose vertices are the vertices of the polygon and there is an edge between two vertices if and only if their corresponding vertices see each other in the polygon. Two points of the polygon see each other if the line segment connecting them lies completely inside (or on the boundary of) the polygon. Although computing the visibility graph of a polygon has been solved efficiently, its reverse problem after three decades is still an open problem. The reverse problem is known as recognition and reconstruction visibility graphs. Recognizing visibility graphs is to determine the necessary and sufficient conditions on a graph to be... 

    Multisymplectic Geometry, Covariant Hamiltonian and Water Waves

    , M.Sc. Thesis Sharif University of Technology Nassaj Najafabadi, Akram (Author) ; Bahraini, Alireza (Supervisor)

    Clustering Data Streams using Core-Sets

    , M.Sc. Thesis Sharif University of Technology Abdi, Masoud (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    We design a new algorithm for clustering data streams in any fixed di- mension, that use the framework of core-set to summarize data, in order to reduce the complexity of computation. Clustering is to separate data into distinct sets called clusters, which objects in the same cluster has the most similarity and objects in the different clusters has the least similarity.This problem has many application in the areas such as: machine learning,image processing, financial and stock transactions. Data stream has recently emerged as an important concept because in many applications, data is inherently streaming over a network or the data base is extremely large and sequential access is way faster... 

    Guarding Orthogonal Polygons with Sliding Cameras

    , M.Sc. Thesis Sharif University of Technology Seddighin, Saeed Reza (Author) ; Ghodsi, Mohammad (Supervisor)
    Abstract
    In this research, we consider the problem of guarding orthogonal polygon with sliding cameras. This problem is originated from the well-known Art Gallery problem. In the Art Gallery problem the goal is to guard the polygon with minimum number of guards. Each guard is considered as a point and can guard all the points inside the polygon that are in its visibility area. In sliding camera version, each guard is modeld as a horizontal or vertical segment which is entirely in the polygon. The guarding area of each camera is defined by its segment and its power. In 0-transmitter model, the guarding area of each camera is limited by the edges of polygon, but in the k-transmitter model cameras can... 

    Separating Colored Points

    , M.Sc. Thesis Sharif University of Technology Assadian, Navid (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    Separating colored points is one of the important problems in computational geometry. In separating colored points problems a set of colored points in Euclidean space are given that each color designates a set of certain data.Different problems can be defined in the colored points subject. Among them,separating colored points is studied in this thesis. It is supposed that two sets of blue and red points are given. It is desired to find the minimum number of rectangles that separate the blue points from the red points. It is demonstrated hat if P ̸= NP then there is no polynomial time algorithm for solving this problem. Then, a constant factor approximation algorithm is introduced and applied... 

    K-Strong Conflict Free Coloring of Regions with Respect to a Family of Points

    , M.Sc. Thesis Sharif University of Technology Daneshvar Amoli, Mohammad Reza (Author) ; Abam, Mohammad Ali (Supervisor)
    Abstract
    The conflict-free coloring is one of the computational geometry problems that has received attention in the last two decades. The root of this problem comes from the frequency allocation problem to telecommunications antennas, where we have several telecommunication antennas in two-dimensional space aiming to assign to each of them a frequency so that every point on the plane, which is at least inside one of the antenna ranges, stays in a range with a frequency different from the other antennas containing point.One of the generalizations of this problem is the k-strong case, where we have n regions (equivalent to the circular region of the antennas) that we want to color so that for each...